Related papers: Discrete tomography: Magic numbers for $N$-fold sy…

This article proposes a new discrete framework for approximating solutions to shape optimization problems under convexity constraints. The numerical method, based on the support function or the gauge function, is guaranteed to generate…

Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow {1,...,n}$ for which there exists a positive integer $k$ such that $\sum_{x\in N(v)}\ell (x)=k$ for all $v\in V $, where $N(v)$…

Holmsen, Kyn\v{c}l and Valculescu recently conjectured that if a finite set $X$ with $\ell n$ points in $\mathbb{R}^d$ that is colored by $m$ different colors can be partitioned into $n$ subsets of $\ell$ points each, such that each subset…

An integer partition \lambda of n corresponds, via its Ferrers diagram, to an artinian monomial ideal I of colength n in the polynomial ring on two variables. If the partition \lambda corresponds to an integrally closed ideal we call…

Let $\lambda_1(n)$ denote the least invariant factor in the invariant factor decomposition of the multiplicative group $M_n = (\mathbb Z/n\mathbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/\sqrt{\log x}$, for the…

Given two maps f_1, f_2 : M^m \longrightarrow N^n between manifolds of the indicated arbitrary dimensions, when can they be deformed away from one another? More generally: what is the minimum number MCC (f_1, f_2) of pathcomponents of the…

A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…

We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…

The relationship between Salem numbers and short geodesics has been fruitful in quantitative studies of arithmetic hyperbolic orbifolds, particularly in dimensions 2 and 3. In this article, we push these connections even further. The…

Thanks to recent advances in parametric geometry of numbers, we know that the spectrum of any set of $m$ exponents of Diophantine approximation to points in $\mathbb{R}^n$ (in a general abstract setting) is a compact connected subset of…

We give the sharp lower bound of the volume product of three dimensional convex bodies which are invariant under a discrete subgroup of $O(3)$ in several cases. We also characterize the convex bodies with the minimal volume product in each…

Cyclotomy, the study of cyclotomic classes and cyclotomic numbers, is an area of number theory first studied by Gauss. It has natural applications in discrete mathematics and information theory. Despite this long history, there are…

Low-dose computed tomography (LDCT) scans, which can effectively alleviate the radiation problem, will degrade the imaging quality. In this paper, we propose a novel LDCT reconstruction network that unrolls the iterative scheme and performs…

This paper extends the Pythagorean Theorem to positive and negative real exponents to take the form a^n + b^n = c^n and makes use of the definition gamma = b/a >= 1. For the case of n in the set of positive real numbers, n greater than or…

The first step in investigating colour symmetries for periodic and aperiodic systems is the determination of all colouring schemes that are compatible with the symmetry group of the underlying structure, or with a subgroup of it. For an…

Using methods developed in multivariate splines, we present an explicit formula for discrete truncated powers, which are defined as the number of non-negative integer solutions of linear Diophantine equations. We further use the formula to…

The cut number of a manifold M, c(M), is the largest number of disjoint two-sided hypersurfaces in M which do not separate M. Equivalently, it is the largest rank of a free group being an epimorphic image of pi_1(M). We investigate the…

Minimum numbers decide e.g. whether a given map f: S^m --> S^n/G from a sphere into a spherical space form can be deformed to a map f' such that f(x) not equal f'(x) for all x in S^m. In this paper we compare minimum numbers to…