Related papers: Discrete tomography: Magic numbers for $N$-fold sy…
A discrete dynamical system known as Arnold's Discrete Cat Map (Arnold's DCM) is given by (x_t+1, y_t+1) = (x_t + y_t, x_t + 2y_t) mod N; which acts on a two-dimensional square coordinate grid of size Nx?N. The defining characteristic of…
A conjecture of Serre concerns the number of rational points of bounded height on a finite cover of projective space P^{n-1}. In this paper, we achieve Serre's conjecture in the special case of smooth cyclic covers of any degree when n is…
We consider the number of partitions of $n$ whose Young diagrams fit inside an $m \times \ell$ rectangle; equivalently, we study the coefficients of the $q$-binomial coefficient $\binom{m+\ell}{m}_q$. We obtain sharp asymptotics throughout…
We are concerned with minimax signal detection. In this setting, we discuss non-asymptotic and asymptotic approaches through a unified treatment. In particular, we consider a Gaussian sequence model that contains classical models as special…
It is conjectured since long that for any convex body $K \subset \mathbb{R}^n$ there exists a point in the interior of $K$ which belongs to at least $2n$ normals from different points on the boundary of $K$. The conjecture is known to be…
We consider a class of special Lagrangian subspaces of Calabi-Yau manifolds and identify their mirrors, using the recent derivation of mirror symmetry, as certain holomorphic varieties of the mirror geometry. This transforms the counting of…
Magic sets of observables are minimal structures that capture quantum state-independent advantage for systems of $n\ge 2$ qubits and are, therefore, fundamental tools for investigating the interface between classical and quantum physics. A…
For a given partition of (1, 2, ..., 2n) into two disjoint subsets A and B with n elements in each, consider the maximum number of times any integer occurs as the difference between an element of A and an element of B. The minimum value of…
We make a number of observations on Conway surreal number theory which may be useful, for further developments, in both in mathematics and theoretical physics. In particular, we argue that the concepts of surreal numbers and matroids can be…
A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…
For a positive integer $m$ and a real number $c$, let $R = R(m,c,2)$ denote the discrete 2-color Rado number for the equation $x_1 + x_2 + \dots + x_m + c = 2x_0$. In other words, $R$ is the smallest integer such that for any coloring of…
Perfect codes in the $n$-dimensio\-nal grid $\Lambda_n$ of the lattice $\mathbb{Z}^n$ ($0<n\in\mathbb{Z}$) and its quotient toroidal grids were obtained via the truncated distance in $\mathbb{Z}^n$ given between $u=(u_1,\cdots,u_n)$ and…
Let $N$ be a lattice of rank $n$ and let $M = N^{\vee}$ be its dual lattice. In this note we show that given two compact, bounded, full-dimensional convex sets $K_1 \subseteq K_2 \subseteq M_{\R} \coloneqq M \otimes_{\Z} \R$, there is a…
The Fibonacci cube $\Gamma_n$ is obtained from the $n$-cube $Q_n$ by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 are removed, the Lucas cube $\Lambda_n$ is obtained. The…
Convex hulls are a fundamental geometric tool used in a number of algorithms. As a side-effect of exhaustive tests for an algorithm for which a convex hull computation was the first step, interesting experimental results were found and are…
A method is developed here for building differentiable three-dimensional manifolds on multicube structures. This method constructs a sequence of reference metrics that determine differentiable structures on the cubic regions that serve as…
We deal with the distribution of the fractional parts of $p^{\lambda}$, $p$ running over the prime numbers and $\lambda$ being a fixed real number lying in the interval $(0,1)$. Roughly speaking, we study the following question: Given a…
Identifying symmetries in data sets is generally difficult, but knowledge about them is crucial for efficient data handling. Here we present a method how neural networks can be used to identify symmetries. We make extensive use of the…
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values…
The effectiveness of Symmetric Positive Definite (SPD) manifold features has been proven in various computer vision tasks. However, due to the non-Euclidean geometry of these features, existing Euclidean machineries cannot be directly used.…