EXPRESS: People’s Preferences for Different Types of Rational Numbers in Linguistic Contexts

Rational numbers, like fractions, decimals, and percentages, differ in the concepts they prefer to express and the entities they prefer to describe as previously reported in display-rational number notation matching tasks and in math word problem compiling contexts. On the one hand, fractions and percentages are preferentially used to express a relation between two magnitudes, while decimals are preferentially used to represent a magnitude. On the other hand, fractions and decimals tend to be used to describe discrete and continuous entities, respectively. However, it remains unclear whether these reported distinctions can extend to more general linguistic contexts. It also remains unclear which factor, the concept to be expressed (magnitudes vs. relations between magnitudes) or the entity to be described (countable vs. continuous), is more predictive of people’s preferences for rational number notations. To explore these issues, two corpus studies and a number notation preference experiment were administered. The news and conversation corpus studies detected the general pattern of conceptual distinctions across rational number notations as observed in previous studies; the number notation preference experiment found that the concept to be expressed was more predictive of people’s preferences for number notations than the entity to be described. These findings indicate that people’s biased uses of rational numbers are constrained by multiple factors, especially by the type of concepts to be expressed, and more importantly, these biases are not specific to mathematical settings but are generalizable to broader linguistic contexts.

A computational status update for exact rational mixed integer programming

The last milestone achievement for the roundoff-error-free solution of general mixed integer programs over the rational numbers was a hybrid-precision branch-and-bound algorithm published by Cook, Koch, Steffy, and Wolter in 2013. We describe a substantial revision and extension of this framework that integrates symbolic presolving, features an exact repair step for solutions from primal heuristics, employs a faster rational LP solver based on LP iterative refinement, and is able to produce independently verifiable certificates of optimality. We study the significantly improved performance and give insights into the computational behavior of the new algorithmic components. On the MIPLIB 2017 benchmark set, we observe an average speedup of 10.7x over the original framework and 2.9 times as many instances solved within a time limit of two hours.

SL$ _n(\mathbb{Z}) $-normalizer of a principal congruence subgroup

<abstract><p>Let SL$ _n(\mathbb{Q}) $ be the set of matrices of order $ n $ over the rational numbers with determinant equal to 1. We study in this paper a subset $ \Lambda $ of SL$ _n(\mathbb{Q}) $, where a matrix $ B $ belongs to $ \Lambda $ if and only if the conjugate subgroup $ B\Gamma_q(n)B^{-1} $ of principal congruence subgroup $ \Gamma_q(n) $ of lever $ q $ is contained in modular group SL$ _n(\mathbb{Z}) $. The notion of least common denominator (LCD for convenience) of a rational matrix plays a key role in determining whether <italic>B</italic> belongs to $ \Lambda $. We show that LCD can be described by the prime decomposition of $ q $. Generally $ \Lambda $ is not a group, and not even a subsemigroup of SL$ _n(\mathbb{Q}) $. Nevertheless, for the case $ n = 2 $, we present two families of subgroups that are maximal in $ \Lambda $ in this paper.</p></abstract>

Khintchine’s theorem with rationals coming from neighborhoods in different places

The Duffin–Schaeffer Conjecture answers a question on how well one can approximate irrationals by rational numbers in reduced form (an imposed condition) where the accuracy of the approximation depends on the rational number. It can be viewed as an analogue to Khintchine’s theorem with the added restriction of only allowing rationals in reduced form. Other conditions such as numerator or denominator a prime, a square-free integer, or an element of a particular arithmetic progression, etc. have also been imposed and analogues of Khintchine’s theorem studied. We prove versions of Khintchine’s theorem where the rational numbers are sourced from a ball in some completion of [Formula: see text] (i.e. Euclidean or [Formula: see text]-adic), while the approximations are carried out in a distinct second completion. Finally, by using a mass transference principle for Hausdorff measures, we are able to extend our results to their corresponding analogues with Haar measures replaced by Hausdorff measures, thereby establishing an analogue of Jarník’s theorem.

A sharp estimate of the discrepancy of a concatenation sequence of inversive pseudorandom numbers with consecutive primes

We consider an equidistributed concatenation sequence of pseudorandom rational numbers generated from the primes by an inversive congruential method. In particular, we determine the sharp convergence rate for the star discrepancy of said sequence. Our arguments are based on well-known discrepancy estimates for inversive congruential pseudorandom numbers together with asymptotic formulae involving prime numbers.

A pair of rational double sequences

Double sequences appear in a natural way in cases of iteratively given sequences if the iteration allows to determine besides the successors from the predecessors also the predecessors from their followers. A particular pair of double sequences is considered which appears in a parqueting-reflection process of the complex plane. While one end of each sequence is a natural number sequence, the other consists of rational numbers. The natural numbers sequences are not yet listed in OEIS Wiki. Complex versions from the double sequences are provided.

Geometry, Coordinatization and Cardinality of the Rational Numbers from Physical Perspective

In this article, we will first discuss the completeness of real numbers in the context of an alternate definition of the straight line as a geometric continuum. According to this definition, points are not regarded as the basic constituents of a line segment and a line segment is considered to be a fundamental geometric object. This definition is in particular suitable to coordinatize different points on the straight line preserving the order properties of real numbers. Geometrically fundamental nature of line segments are required in physical theories like the string theory. We will construct a new topology suitable for this alternate definition of the straight line as a geometric continuum. We will discuss the cardinality of rational numbers in the later half of the article. We will first discuss what we do in an actual process of counting and define functions well-defined on the set of all positive integers. We will follow an alternate approach that depends on the Hausdorff topology of real numbers to demonstrate that the set of positive rationals can have a greater cardinality than the set of positive integers. This approach is more consistent with an actual act of counting. We will illustrate this aspect further using well-behaved functionals of convergent functions defined on the finite dimensional Cartezian products of the set of positive integers and non-negative integers. These are similar to the partition functions in statistical physics. This article indicates that the axiom of choice can be a better technique to prove theorems that use second-countability. This is important for the metrization theorems and physics of spacetime.