Search

This study aims at understanding the role of the tools chosen throughout the processes of solving a non-routine mathematical problem and communicating its solution. In assuming that problem-solving is a synchronous activity of mathematization and expression of mathematical thinking we take our proposed Mathematical Problem Solving with Technology (MPST) model to analyze the processes of solving-and-expressing-problems. Resorting to qualitative methods for data collection and analysis, we report on the case of an 8th grader working on a covariation problem to examine the role that paper-and-pencil and digital tools play in the development of a conceptual model of the situation. We found that the resources used throughout the solving-and-expressing activity influenced the depth of the conceptual model developed, within a process of progressive mathematization. Whereas paper-and-pencil led to the emergence of a conceptual model based on exploring particular cases, the digital transformation of the solution was triggered by the process of communicating its mathematical justification and expanded the previous model. Moreover, the complexity of this activity is evidenced by its multiple sequences of processes. Finally, the integration process seems crucial as the concomitant use of technological and mathematical resources precedes major advancements in the expansion of the conceptual model.

We investigated the influence of mental imagery expertise in 15 pen and paper role-players as an expert group compared to the gender-matched control group of computer role-players in the difficult Vandenberg and Kuse mental rotation task. In this task, the participants have to decide which two of four rotated figures match the target figure. The dependent measures were performance speed and accuracy. In our exploratory investigation, we further examined midline frontal theta band activation, parietal alpha band activation, and parietal alpha band asymmetry in EEG as indicator for the chosen rotation strategy. Additionally, we explored the gender influence on performance and EEG activation, although a very small female sample section was given. The expected gender difference concerning performance accuracy was negated by expertise in pen and paper role-playing women, while the gender-specific difference in performance speed was preserved. Moreover, gender differences concerning electro-cortical measures revealed differences in rotation strategy, with women using top-down strategies compared to men, who were using top-down strategies and active inhibition of associative cortical areas. These strategy uses were further moderated by expertise, with higher expertise leading to more pronounced activation patters, especially during successful performance. However, due to the very limited sample size, the findings of this explorative study have to be interpreted cautiously.

Investigating the research trends within a scientific domain by analyzing semantic information extracted from scientific journals has been a topic of interest in the natural language processing (NLP) field. A research trend evaluation is generally based on the time evolution of the term occurrence or the term topic, but it neglects an important aspect—research publication latency. The average time lag between the research and its publication may vary from one month to more than one year, and it is a characteristic that may have significant impact when assessing research trends, mainly for rapidly evolving scientific areas. To cope with this problem, the present paper is the first work that explicitly considers research publication latency as a parameter in the trend evaluation process. Consequently, we provide a new trend detection methodology that mixes auto-ARIMA prediction with Mann–Kendall trend evaluations. The experimental results in an electronic design automation case study prove the viability of our approach.

A classical result of K. L. Chung and W. Feller deals with the partial sums S k S_k arising in a fair coin-tossing game. If N n N_n is the number of “positive” terms among S 1 S_1 , S 2 S_2 , …, S n S_n then the quantity P ( N 2 n = 2 r ) P(N_{2n} = 2r) takes an elegant form. We lift the restriction on an even number of tosses and give a simple expression for P ( N 2 n + 1 = r ) P(N_{2n+1} = r) , r = 0 r = 0 , 1 1 , 2 2 , …, 2 n + 1 2n+1 . We get to this ansatz by adaptating the Feynman–Kac methodology.

Paper waste in the mockups design with regular, irregular, and amorphous patterns is a critical problem in digital printing presses. Paper waste reduction directly impacts production costs, generating business and environmental benefits. This problem can be mapped to the two-dimensional irregular bin-packing problem. In this paper, an iterated local search algorithm using a novel neighborhood structure to detect overlaps between amorphous shapes is introduced. This algorithm is used to solve the paper waste problem, modeled as one 2D irregular bin-packing problem. The experimental results show that this approach works efficiently and effectively to detect and correct the overlaps between regular, irregular, and amorphous figures.

In this paper, we first generalize to any hyper-Kahler manifold X with $$b_3(X)\not =0$$ results proved by O’Grady for hyper-Kahler manifolds of generalized Kummer type. In the second part, we restrict to hyper-Kahler manifolds of generalized Kummer type and prove, using results of Markman, that their Kuga–Satake correspondence is algebraic.

Rewinding machines are used in the paper converting industrial sector to unroll paper veils from large source reels and wind them around smaller rolls, for the production of paper logs to be used in household activities. Many different types of rewinding machine exist, and they are mostly based on stapling devices which automatically unroll a large coil of paper, roll it up around a new log, stop the veil allowing it to be torn off, unload the completed paper log, and reload a new paper core to be rolled up. Winding units generally include a primary and a secondary roller, supplying the desired rotational speed for winding, and a pressure unit consisting of a pressure roller in contact with the paper log being rolled up, which assures adequate containment and avoids the paper log to escape. All known systems have some mechanical limitations, mainly due to the contact of the pressure roller with the paper log, causing instabilities and vibrations, particularly when working with soft paper veils. This limits the maximum possible winding speed. The aim of this paper is it to present a detailed kinematic analysis of a novel pressure unit which overcomes the aforementioned limitation.

Erratum to the paper [Konovalov, Alexander; Smoktunowicz, Agata; Vendramin, Leandro. On skew braces and their ideals. Exp. Math. 30 (2021), no. 1, 95–104. DOI: 10.1080/10586458.2018.1492476.].

Sendov’s conjecture states that if all the zeroes of a complex polynomial P(z) of degree at least two lie in the unit disk, then within a unit distance of each zero lies a critical point of P(z). In a paper that appeared in 2014, Degot proved that, for each a ∈ (0, 1), there exists an integer N such that for any polynomial P(z) with degree greater than N, if P(a) = 0 and all zeroes lie inside the unit disk, the disk |z − a| ≤ 1 contains a critical point of P(z). Based on this result, we derive an explicit formula N(a) for each a ∈ (0, 1) and, consequently obtain a uniform bound N for all a ∈ [α, β] where 0 < α < β < 1. This (partially) addresses the questions posed in Degot’s paper.

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

This work is a contribution to the Project UIDB/04035/2020, funded by FCT - Fundacao para a Ciencia e a Tecnologia, Portugal.

Let l be a Banach sequence space with a monotone norm in which the canonical system (e_{n}) is an unconditional basis. We show that if there exists a continuous linear unbounded operator between l-K\"{o}the spaces, then there exists a continuous unbounded quasi-diagonal operator between them. Using this result, we study in terms of corresponding K\"{o}the matrices when every continuous linear operator between l-K\"{o}the spaces is bounded. As an application, we observe that the existence of an unbounded operator between l-K\"{o}the spaces, under a splitting condition, causes the existence of a common basic subspace.

The paper alluded to in the title contains the following striking result: Let $I$ be the unit interval and $\Delta$ the Cantor set. If $X$ is a quasi Banach space containing no copy of $c_0$ which is isomorphic to a closed subspace of a space with a basis and $C(I, X)$ is linearly homeomorphic to $C(\Delta, X)$, then $X$ is locally convex, i.e., a Banach space. It is shown that Kalton result is sharp by exhibiting non locally convex quasi Banach spaces X with a basis for which $C(I, X)$ and $C(\Delta, X)$ are isomorphic. Our examples are rather specific and actually in all cases X is isomorphic to $C(\Delta, X)$ if $K$ is a metric compactum of finite covering dimension., Comment: 4 pages

We introduce our efforts within the project ‘The science of deep specification’ to work out the key formal underpinnings of industrial-scale formal specifications of software and hardware components, anticipating a world where large verified systems are routinely built out of smaller verified components that are also used by many other projects. We identify an important class of specification that has already been used in a few experiments that connect strong component-correctness theorems across the work of different teams. To help popularize the unique advantages of that style, we dub itdeep specification, and we say that it encompasses specifications that arerich,two-sided,formalandlive(terms that we define in the article). Our core team is developing a proof-of-concept system (based on the Coq proof assistant) whose specification and verification work is divided across largely decoupled subteams at our four institutions, encompassing hardware microarchitecture, compilers, operating systems and applications, along with cross-cutting principles and tools for effective specification. We also aim to catalyse interest in the approach, not just by basic researchers but also by users in industry.This article is part of the themed issue ‘Verified trustworthy software systems’.

In this paper we correct an inaccuracy that appears in the proof of Theorem 1. in Czerwik's article "Contraction mappings in $b$-metric spaces.", Acta Math. Inform. Univ. Ostraviensis, 1:5--11, 1993., 3 pages

The purpose of this short note is to present a correction of the proof of the main result given in the paper “Equivalence of the existence of best proximity points and best proximity pairs for cyclic and noncyclic nonexpansive mappings,” Demonstr. Math. 53 (2020), 38–43.

P values linked to null hypothesis significance testing (NHST) is the most widely (mis)used method of statistical inference. Empirical data suggest that across the biomedical literature (1990–2015)...

This paper is a corrigendum to the article ``On the ideal theorem for number fields''. The main result of this paper proves to be untrue and is replaced by an estimate of a weighted sum with an improved error term.

This comment is devoted to the paper “Lie Symmetry Analysis, Explicit Solutions, and Conservation Laws of a Spatially Two-Dimensional Burgers–Huxley Equation” (Symmery, 2020, vol.12, 170), in which several results are either incorrect, or incomplete, or misleading.

We correct a mistake in a lemma in the paper cited in the title and show that it did not affect any of the other results of the paper. To this end, we prove results on linearly disjoint field extensions that do not seem to be commonly known. We give an example to show that a separability assumption in one of these results cannot be dropped (doing so had led to the mistake). Further, we discuss recent generalizations of the original classification of defect extensions.

In 1903, Epstein published his proof of meromorphic continuation and a functional equation for Dirichlet series associated with quadratic forms, now called Epstein zeta-functions. However, already in 1889 (or even earlier) Hurwitz was aware of these results as his mathematical diaries and some unpublished notes (in an almost final form) found in his estate at the ETH Zurich show. In this article we present and analyze Hurwitz's notes and compare his reasoning with Epstein's paper in detail.

We congratulate the authors Bertsimas, Pauphilet and van Parys (hereafter BPvP) and Hastie, Tibshirani and Tibshirani (hereafter HTT) for providing fresh and insightful views on the problem of variable selection and prediction in linear models. Their contributions at the fundamental level provide guidance for more complex models and procedures.

We give common generalizations of the Menon-type identities by Sivaramakrishnan (1969) and Li, Kim, Qiao (2019). Our general identities involve arithmetic functions of several variables, and also contain, as special cases, identities for gcd-sum type functions. We point out a new Menon-type identity concerning the lcm function. We present a simple character free approach for the proof., Comment: 14 pages

Inspired by the article “Anomalous relaxation model based on the fractional derivative with a Prabhakar-like kernel” (Z. Angew. Math. Phys. (2019) 70:42) whose authors Zhao and Sun studied the integro-differential equation with the kernel given by the Prabhakar function $$e^{-\gamma }_{\alpha , \beta }(t, \lambda )$$ , we provide the solution to this equation which is complementary to that obtained up to now. Our solution is valid for effective relaxation times whose admissible range extends the limits given in Zhao and Sun (Z Angew Math Phys 70:42, 2019, Theorem 3.1) to all positive values. For special choices of parameters entering the equation itself and/or characterizing the kernel, the solution comprises to known phenomenological relaxation patterns, e.g., to the Cole–Cole model (if $$\gamma = 1, \beta =1-\alpha $$ ) or to the standard Debye relaxation.

The translation into English of Aleksandr Yakovlevich Khinchin's (1894–1959) 1926 paper entitled ‘Ideas of intuitionism and the struggle for a subject matter in contemporary mathematics’ is made available for the first time. Here, Khinchin presented the famous foundational debate between L.E.J. Brouwer and David Hilbert of the 1920s in terms of a search for a mathematics with content. His main aim seems to have been to make intuitionism ideologically acceptable to his audience at the Communist Academy by means of the claim that insofar as Brouwer's intuitionism had a clear ‘subject matter’ and Hilbert's new program was a concession to intuitionism, the alleged victory of intuitionism not only implied the defeat of ‘empty’ formalism, but also showed the compatibility and affinity of Marxism with the newest developments in modern mathematics. This introduction provides a tentative exploration of the issue of what was tactical (or due to ideological pressure) and what was real scientific interest (or due to ignorance) (or what was both) in Khinchin's 1926 paper in the form of a detailed commentary, especially, on the tactical side of his presentation of the positions of Brouwer and Hilbert.

A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.

We correct an error in the paper of Z. Shen, S. Li, and J. Zhang published in [4]. In addition, we give an answer to a question posed by the authors.

Presented in this paper are the findings of the panel entitled Outlets for undergraduate research as delivered at the Trends in Undergraduate Research in Mathematical Sciences (TURMS) in Chicago on October 27, 2012. We specifically discuss venues and best practices for student papers, posters, and presentations.

This expository paper presents known results on distribution functions g(x) of the sequence of blocks where xn is an increasing sequence of positive integers. Also presents results of the set G(Xn) of all distribution functions g(x). Specially: - continuity of g(x); - connectivity of G(Xn); - singleton of G(Xn); - one-step g(x); - uniform distribution of Xn, n = 1, 2, . . . ; - lower and upper bounds of g(x); - applications to bounds of ; - many examples, e.g., , where pn is the nth prime, is uniformly distributed. The present results have been published by 25 papers of several authors between 2001-2013.

Let [Formula: see text] be a projective variety of dimension [Formula: see text] over an algebraically closed field of arbitrary characteristic. We prove a Fujiki–Lieberman type theorem on the structure of the automorphism group of [Formula: see text]. Let [Formula: see text] be a group of zero entropy automorphisms of [Formula: see text] and [Formula: see text] the set of elements in [Formula: see text] which are isotopic to the identity. We show that after replacing [Formula: see text] by a suitable finite-index subgroup, [Formula: see text] is a unipotent group of the derived length at most [Formula: see text]. This result was first proved by Dinh et al. for compact Kähler manifolds.

We characterize functions of finite energy in the plane in terms of their traces on the lines that make up "graph paper" with squares of side length $mn$ for all $n$, and certain $\12-$order Sobolev norms on the graph paper lines. We also obtain analogous results for functions of finite energy on two classical fractals: the Sierpinski gasket and the Sierpinski carpet.

The aim of this paper is to study a new equivalent form of the weak maximum principle for a large class of differential operators on Riemannian manifolds. This new form has been inspired by the work of Berestycki, Hamel and Rossi for trace operators, and allows us to shed new light on it and to introduce a new sufficient bounded Khas’minskii type condition for its validity. We show its effectiveness by applying it to obtain some uniqueness results in a geometric setting.

We complete a gap in the proof that exceptional polynomials are complete orthogonal systems in the associated Hilbert spaces.

The aim of this paper is to discuss the main result in the paper by D.Y. Gao and X. Lu [On the extrema of a nonconvex functional with double-well potential in 1D, Z. Angew. Math. Phys. (2016) 67:62]. More precisely we provide a detailed study of the problem considered in that paper, pointing out the importance of the norm on the space $C^{1}[a,b]$; because no norm (topology) is mentioned on $C^{1}[a,b]$ we look at it as being a subspace of $W^{1,p}(a,b)$ for $p\in [1,\infty]$ endowed with its usual norm. We show that the objective function has not local extrema with the mentioned constraints for $p\in [1,4)$, and has (up to an additive constant) only a local maximizer for $p=\infty$, unlike the conclusion of the main result of the discussed paper where it is mentioned that there are (up to additive constants) two local minimizers and a local maximizer. We also show that the same conclusions are valid for the similar problem treated in the preprint by X. Lu and D.Y. Gao [On the extrema of a nonconvex functional with double-well potential in higher dimensions, arXiv:1607.03995]., 12 pages; in this version we added the forgotten condition $F(x) \ne 0$ for $x\in (a,b)$ on page 3

Origami is the ancient Japanese art of paper folding. It is possible to fold many intriguing geometrical shapes with paper [M]. In this article, the question we will answer is which shapes are possible to construct and which shapes are impossible to construct using origami. One of the most interesting things we discovered is that it is impossible to construct a cube with twice the volume of a given cube using origami, just as it is impossible to do using a compass and straight edge. As an unexpected surprise, our algebraic characterization of origami is related to David Hilbert's 17th problem. Hilbert's problem is to show that any rational function which is always non-negative is a sum of squares of rational functions [B]. This problem was solved by Artin in 1926 [Ar]. We would like to thank John Tate for noticing the relationship between our present work and Hilbert's 17th problem. This research is the result of a project in the Junior Fellows Program at The University of Texas. The Junior Fellows Program is a program in which a junior undergraduate strives to do original research under the guidance of a faculty mentor. The referee mentioned two references which the reader may find interesting. "Geometric Exercises in Paper Folding" addresses practical problems of paper folding [R]. Arnong many other things, Sundara Row gives constructions for the 5-gon, the 17-gon, and duplicating a cube. His constructions, however, use more general folding techniques than the ones we consider here. Felix Klein cites Row's work in his lectures on selected questions in elementary geometry [K]. In order to understand the rules of origami construction, we will first consider a sheet of everyday notebook paper. Our work with notebook paper will serve as an intuitive model for our definition of origami constructions in the Euclidean plane. There are four natural methods of folding a piece of paper. The methods will serve as the basis of the definition of an origami pair. We construct the line L1, by folding a crease between two different corners of the paper. Another line may be constructed by matching two corners. For example, if corners or and Sy are matched, the crease formed, L2, will be the perpendicular bisector of the segment orSy. Another natural construction is matching one line to another line. For instance, ,8^y, the paper's edge, and L2 are lines. If we lay ,8^y upon L2 and form the crease, then we obtain L3 which is the angle bisector of the two lines. If we start with two parallel lines in this third construction, then we will just get a parallel line half way in between. The fourth and final construction which seems natural is consecutive folding. This is similar to rolling up the sheet of paper only one does not roll it up, he folds it up. More explicitly, start with a piece of paper with two creases on it as in Figure 2. Fold along line Ll and do not unfold the piece of paper. Notice that line L2 lies

In this paper author was proved the boundedness of the multidimensional Hardy type operator in weighted Lebesgue spaces with a variable exponent. As an application we prove the boundedness of certain sublinear operators on the weighted variable Lebesgue space. Note that the proof of multidimensional Hardy type operator in weighted Lebesgue spaces with a variable exponent don't contained any mistakes. But at the proving of the boundedness of certain sublinear operators on the weighted variable Lebesgue space Georgian colleagues discovered a small but significant error in this paper. This result is assigned as Theorem 5 in noted paper. In other words, sufficient conditions for general weights ensuring the validity of the two-weight strong type inequalities for some sublinear operator was found. In this theorem the inequality (9) isn't true. In this note we give the details of the correct argument. We presume that the reader is familiar with the contents and notation of our original paper. At the heart of our correction is the following Theorem which replaces Theorem 5.