A new arXiv preprint reports asymptotic upper bounds for integer sets built from Dedekind’s function, Euler’s totient and the sum-of-divisors function. It also establishes density-zero results for repeated applications of Dedekind’s function, while leaving the sharpness of its main bounds open.
A mathematical preprint says a refined bound on the common zeros of polynomial systems proves a cited minimum-distance conjecture for evaluation codes on reduced complete intersections. It also derives lower bounds for generalized Hamming weights, but leaves a broader claim about projective Cartesian codes as a conjecture.
A new arXiv preprint examines how numerical semigroups are arranged in a rooted tree. Its finite enumerations report more internal than leaf semigroups under several fixed conditions, but the proposed universal and asymptotic patterns remain unproved.
A mathematics preprint describes explicit common-denominator constructions for selected pairs of real numbers, reporting an exponent above one-half and conditional links to the classical and p-adic Littlewood conjectures.
The work compares Selmer and fine Selmer groups across nearby Z_p-extensions. It reports non-increasing μ bounds, conditional λ bounds and a nearby characteristic-ideal relation when the cyclotomic Main Conjecture and zero reference invariants are assumed.
A mathematical preprint presents an explicit description of the local Langlands parameter for a restricted class of representations of GL(2n, F). It derives the parameter from a quasi-character of E_f and matches formulas for twisted gamma factors. The result is formal mathematical work, not an empirical study, and the comparison is stated under the condition that p does not divide 2n.
The finite-dimensional analysis gives exact algebraic criteria for quaternionic channel liftability and error correction, then identifies the compositional and nonassociative boundaries facing octonionic models.
A new arXiv preprint develops an arithmetic for the class of linear orders under ordered sum. Using a generalized Euclidean algorithm, it proves cancellation and division results, gives affirmative answers to Tarski’s sum problems within this setting, characterizes when two orders commute, and identifies which commutative semigroups can be represented there.
A mathematical preprint presents an if-and-only-if framework connecting G-equivariant Hörmander pseudodifferential operators with representation-theoretic symbols and rapidly decaying kernels.
An arXiv preprint gives a theorem-based classification of the module factors and Jordan forms that can occur when elements of prime order act with a prescribed number of non-trivial blocks.