Related papers: Initial Steps in the Classification of Maximal Med…
Determining the maximal density $m_1(\mathbb{R}^2)$ of planar sets without unit distances is a fundamental problem in combinatorial geometry. This paper investigates lower bounds for this quantity. We introduce a novel approach to…
Periodic point sets model all solid crystalline materials (crystals) whose atoms can be considered zero-sized points with or without atomic types. This paper addresses the fundamental problem of checking whether claimed crystals are novel,…
Let X be a real nondegenerate projective subvariety such that its set of real points is Zariski dense. We prove that every real quadratic form that is nonnegative on X is a sum of squares of linear forms if and only if X is a variety of…
We call a matrix completely mixable if the entries in its columns can be permuted so that all row sums are equal. If it is not completely mixable, we want to determine the smallest maximal and largest minimal row sum attainable. These…
Softmax mixture models (SMMs) are discrete $K$-mixtures introduced to model the probability of choosing an attribute $x_j \in \RR^L$ from $p$ candidates, in heterogeneous populations. They have been known as mixed multinomial logits in the…
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional…
This paper determines almost symmetric numerical semigroups with maximal reduced type completely. In addition, this paper classifies MED-semigroups with maximal reduced type.
Each straight infinite line defined by two vertices of a finite square point lattice contains (covers) these two points and a - possibly empty - subset of points that happen to be collinear to these. This work documents vertex subsets of…
Artinian integrally closed monomial ideals are characterized by their Newton polyhedra, which are lattice polyhedra inside the positive orthant having the positive orthant as their recession cone. Multiplication of such ideals correspond to…
Let $A$ be a set of finite integers, define $$A+A \ = \ \{a_1+a_2: a_1,a_2 \in A\}, \ \ \ A-A \ = \ \{a_1-a_2: a_1,a_2 \in A\},$$ and for non-negative integers $s$ and $d$ define $$sA-dA\ =\ \underbrace{A+\cdots+A}_{s}…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
We introduce a numerical method that enables efficient modelling of light scattering by large, disordered ensembles of non-spherical particles incorporated in stratified media, including when the particles are in close vicinity to each…
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
Closed-form expressions were recently derived for depolarization dyadics for truncated spheres and truncated spheroids, and the formalism was extended to truncated ellipsoids. These results were exploited to develop an implementation of the…
We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…
We characterize the maximum controlled invariant (MCI) set for discrete- as well as continuous-time nonlinear dynamical systems as the solution of an infinite-dimensional linear programming problem. For systems with polynomial dynamics and…
A non-minimal approximation for effective masses of light and heavy neutrinos in the framework of a type-I seesaw mechanism with three generations of sterile Majorana neutrinos which recover the symmetry between quarks and leptons is…