Related papers: The numbers behind Plimpton 322
A plausible architecture of an ancient genetic code is derived from an extended base triplet vector space over the Galois field of the extended base alphabet {D, G, A, U, C}, where the letter D represents one or more hypothetical bases with…
In this paper, we present a possible theoretical explanation for benford's law. We develop a recursive relation between the probabilities, using simple intuitive ideas. We first use numerical solutions of this recursion and verify that the…
Recently, Harrington, Litman, and Wong [Bulletin of the Australian Mathematical Society, 2024; arXiv:2303.06534] proved that every arithmetic progression contains infinitely many base-$b$ Niven numbers, for any fixed $b\ge 2$. We use a…
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…
This article studies three-dimensional objects and their volumes in Elamite mathematics, particularly those found in the Susa Mathematical Tablet No.\,14 (\textbf{SMT No.\,14}). In our discussion, we identify some basic solids whose volumes…
A new application of polytope theory to Lie theory is presented. Exponential sums of convex lattice polytopes are applied to the characters of irreducible representations of simple Lie algebras. The Brion formula is used to write a polytope…
While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…
Markov numbers are integers that appear in the solution triples of the Diophantine equation, $x^2+y^2+z^2=3xyz$, called the Markov equation. A classical topic in number theory, these numbers are related to many areas of mathematics such as…
The occurrence of Simpson's paradox (SP) in $2\times 2$ contingency tables has been well studied. The present work comprehensively revisits this problem using a combination of philosophical reflections, causal considerations, and…
The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…
Some of the subtleties of the integrability of the elliptic quantum billiard are discussed. A well known classical constant of the motion has in the quantum case an ill-defined commutator with the Hamiltonian. It is shown how this problem…
{\bf In the fourth extended version of this article, we provide a comprehensive historical survey of 200 different proofs of famous Euclid's theorem on the infinitude of prime numbers (300 {\small B.C.}--2022)}. The author is trying to…
We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well quasi-ordered has a rational generating function. To do so we show that any such class is…
In a recent paper A.Beardon and I.Short proposed to use chains of tangent horocycles as an extended tool describing continued fractions. We review the origin of such construction from the Moebius transformations point of view. Related…
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
we derive new, improved lower bounds for the block complexity of an irrational algebraic number and for the number of digit changes in the b-ary expansion of an irrational algebraic number. To this end, we apply a quantitative version of…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…
The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For $n=2$ such a procedure is well known, when new variables are components of spinors and they are widely used…
The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product formula, has been stated independently by George Andrews and David Robbins around 1983. We present a…