Related papers: Range of magic constant on Hexagonal Tortoise Prob…
For a ring $R$, Hilbert's Tenth Problem $HTP(R)$ is the set of polynomial equations over $R$, in several variables, with solutions in $R$. We view $HTP$ as an operator, mapping each set $W$ of prime numbers to $HTP(\mathbb Z[W^{-1}])$,…
Half turn symmetric alternating sign matrices (HTSASMs) are special variations of the well-known alternating sign matrices which have a long and fascinating history. HTSASMs are interesting combinatorial objects in their own right and have…
Ever since E. T. Parker constructed an orthogonal pair of $10\times10$ Latin squares in 1959, an orthogonal triple of $10\times10$ Latin squares has been one of the most sought-after combinatorial designs. Despite extensive work, the…
We discuss a possible scenario to solve the hierarchy problem, in which 4-dimensional bosonic fields with all possible integer spins, graviton, gauge boson and Higgs are unified in a framework of a gravity theory with extra dimensions. The…
We extend the so-called "single ring theorem"[1], also known as the Haagerup-Larsen theorem[2], by showing that in the limit when the size of the matrix goes to infinity a particular correlator between left and right eigenvectors of the…
In 1908, Voronoi introduced an algorithm that solves the lattice packing problem in any dimension in finite time. Voronoi showed that any lattice with optimal packing density must be a so-called perfect lattice, and his algorithm enumerates…
A classical theorem of MacMahon states that the number of lozenge tilings of any centrally symmetric hexagon drawn on the triangular lattice is given by a beautifully simple product formula. In this paper we present a counterpart of this…
We calculate the Hausdorff dimension of the fractal set \begin{equation*} \Big\{\mathtt{x}\in \mathbb{T}^d: \prod_{1\leq i\leq d}|T_{\beta_i}^n(x_i)-x_i| < \psi(n) \text{ for infinitely many } n\in \mathbb{N}\Big\}, \end{equation*} where…
Mathematics olympiads are prestigious competitions, with problem proposing and solving highly honored. Building artificial intelligence that proposes and solves olympiads presents an unresolved challenge in automated theorem discovery and…
Identifying the spectrum of the sum of two given Hermitian matrices with fixed eigenvalues is the famous Horn's problem.In this note, we investigate a variant of Horn's problem, i.e., we identify the probability density function (abbr. pdf)…
The numerical sign problem remains one of the central challenges in computational physics. The Worldvolume Hybrid Monte Carlo (WV-HMC) method has recently been proposed as a reliable and computationally efficient algorithm that crucially…
Traditional Markov Chain Monte Carlo methods suffer from low acceptance rate, slow mixing and low efficiency in high dimensions. Hamiltonian Monte Carlo resolves this issue by avoiding the random walk. Hamiltonian Monte Carlo (HMC) is a…
Hamiltonian Monte Carlo (HMC) is a widely deployed method to sample from high-dimensional distributions in Statistics and Machine learning. HMC is known to run very efficiently in practice and its popular second-order "leapfrog"…
In 1973, Neil Sloane published a very short paper introducing an intriguing problem: Pick a decimal integer $n$ and multiply all its digits by each other. Repeat the process until a single digit $\Delta(n)$ is obtained. $\Delta(n)$ is…
Ring puzzles are tessellations of the Euclidean plane respecting local constraints around vertices. Such puzzles may arise in geometric group theory, for example, as embedded flat planes in certain CAT(0) complexes of dimension 2. In the…
In a pioneering exposition of mathematical astronomy for the public, Sir John Herschel attributed the stability of the ring of Saturn to its being eccentric with respect to the planet and lopsided (asymmetric in mass) by a minute amount.…
This paper tells the story how a MAPLE-assisted quest for an interesting undergraduate problem in trigonometric series led some "amateurs" to the discovery that the one-parameter family of deterministic trigonometric series $\pzcS_p:…
This article explores the limits of geometric construction using various tools, both classical and modern. Starting with ruler and compass constructions, we examine how adding methods such as origami, marked rulers (neusis), conic sections,…
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…
The computational complexity of optimum decoding for an orthogonal space-time block code G satisfying the orthogonality property that the Hermitian transpose of G multiplied by G is equal to a constant c times the sum of the squared symbols…