Related papers: Initial Steps in the Classification of Maximal Med…

Starting with 'High Scale Mixing Unification' hypothesis, we investigate the renormalization group evolution of mixing parameters and masses for both Dirac and Majorana type neutrinos. Following this hypothesis, the PMNS mixing parameters…

We extend our study of Motion Planning via Manifold Samples (MMS), a general algorithmic framework that combines geometric methods for the exact and complete analysis of low-dimensional configuration spaces with sampling-based approaches…

The visibility of lattice points from the origin along a polynomial family of curves constitutes a significant generalization of visibility along straight lines. Following the classical notion, where the density equals 1/2, and its…

We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…

We establish lower bounds on the rank of matrices in which all but the diagonal entries lie in a multiplicative group of small rank. Applying these bounds we show that the distance sets of finite pointsets in $\mathbb{R}^d$ generate high…

The classical Remez inequality bounds the maximum of the absolute value of a real polynomial $P$ of degree $d$ on $[-1,1]$ through the maximum of its absolute value on any subset $Z\subset [-1,1]$ of positive Lebesgue measure. Extensions to…

Two constructions of lattice packings of $ n $-dimensional cross-polytopes ($ \ell_1 $ balls) are described, the density of which exceeds that of any prior construction by a factor of at least $ 2^{\frac{n}{\ln n}(1 + o(1))} $ when $ n \to…

Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb…

We calculate the maximal dimension of linear spaces of symmetric and hermitian matrices with given high rank, generalizing a well-known result of Adams {\em et al.}

The degree of a lattice polytope is a notion in Ehrhart theory that was studied quite intensively over the previous years. It is well-known that a lattice polytope has normalized volume one if and only if its degree is zero. Recently,…

We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…

We give a construction of MV-polytopes of a complex semisimple algebraic group G in terms of the geometry of the Bott-Samelson variety and the affine building. This is done by using the construction of dense subsets of MV-cycles by Gaussent…

Consider a real point configuration $\mathbf{A}$ of size $n$ and an integer $r \leq n$. The vertices of the $r$-lineup polytope of $\mathbf{A}$ correspond to the possible orderings of the top $r$ points of the configuration obtained by…

We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…

We introduced the concept of a metric value set (MVS) in an earlier paper \cite{GM} and developed the idea further in \cite{AS}. In this paper we study locally $M$-metrizable spaces and the products of $M$-metrizable spaces. Finally we…

There has recently been ample interest in the question of which sets can be represented by linear matrix inequalities (LMIs). A necessary condition is that the set is rigidly convex, and it has been conjectured that rigid convexity is also…

A matrix $M$ over the finite field $ \mathbb{F}_q $ is called \emph{maximum distance separable} (MDS) if all of its square submatrices are non-singular. These MDS matrices are very important in cryptography and coding theory because they…

Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…

We initiate the study of subpolytopes of the permutahedron that arise as the convex hulls of stack-sorting on permutations. We primarily focus on $Ln1$ permutations, i.e., permutations of length $n$ whose penultimate and last entries are…

Processes of the form $pp\to anything \to X_i X_j \to x\bar{x} + y\bar{y} (+ \slashchar{E})$ are studied via a technique that may be viewed as an adaptation of time-honoured Dalitz plot analyses. $X_i$ and $X_j$ are new heavy states (with…