相关论文: A realization theorem for sets of distances

Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…

Motivated by notions from coding theory, we study the generalized minimum distance (GMD) function $\delta_I(d,r)$ of a graded ideal $I$ in a polynomial ring over an arbitrary field using commutative algebraic methods. It is shown that…

Label the vertices of the complete graph $K_v$ with the integers $\{ 0, 1, \ldots, v-1 \}$ and define the length of the edge between $x$ and $y$ to be $\min( |x-y| , v - |x-y| )$. Let $L$ be a multiset of size $v-1$ with underlying set…

Hamiltonian Truncation (HT) is a numerical approach for calculating observables in a Quantum Field Theory non-perturbatively. This approach can be applied to theories constructed by deforming a conformal field theory with a relevant…

We show that the distance from an element of a C*-algebra to the set of regular elements is the infimum of the $\delta>0$ for which the $\delta$-cut-down of the element admits a polar decomposition within the algebra. This parallels results…

Building on the work of Gabriel Conant, we investigate the enumeration problems of finite distance monoids by applying the decomposition of Archimedean classes and studying their internal arithmetic progressions. Specifically, we first…

A vector space partition of $\mathbb{F}_q^v$ is a collection of subspaces such that every non-zero vector is contained in a unique element. We improve a lower bound of Heden, in a subcase, on the number of elements of the smallest occurring…

Let $\mathbb{F}_q$ be an arbitrary finite field, and $\mathcal{E}$ be a set of points in $\mathbb{F}_q^d$. Let $\Delta(\mathcal{E})$ be the set of distances determined by pairs of points in $\mathcal{E}$. By using the Kloosterman sums,…

Our motivating goal is factorization in Krull Domains $H$ with finitely generated class group $G$. The elasticity $\rho(H)$ is the maximal number of atoms in any re-factorization of a product of $k$ atoms. The elasticities are the same as…

Transfer Krull monoids are a recent concept including all commutative Krull domains and also, for example, wide classes of non-commutative Dedekind domains. We show that transfer Krull monoids are fully elastic (i.e., every rational number…

Euclidean distance matrices (EDM) are symmetric nonnegative matrices with several interesting properties. In this article, we introduce a wider class of matrices called generalized Euclidean distance matrices (GDMs) that include EDMs. Each…

Let $\Omega \subset \mathbb{R}^{N}$ be a smooth bounded domain, $H$ a Caratheodory function defined in $\Omega \times \mathbb{R\times R}^{N},$ and $\mu $ a bounded Radon measure in $\Omega .$ We study the problem% \begin{equation*}…

This paper makes a deep study of regular two-distance sets. A set of unit vectors $X$ in Euclidean space $\RR^n$ is said to be regular two-distance set if the inner product of any pair of its vectors is either $\alpha$ or $\beta$, and the…

Some of the fundamental notions related to sets of lengths of Krull monoids with finite class group are discussed, and a survey of recent results is given. These include the elasticity and related notions, the set of distances, and the…

Let $f$ and $g$ be two elliptic elements in $\mathbf{PU}(2,1)$ of order $m$ and $n$ respectively, where $m\geq n>2$. We prove that if the distance $\delta(f,g)$ between the complex lines or points fixed by $f$ and $g$ is large than a…

For any (real) algebraic variety $X$ in a Euclidean space $V$ endowed with a nondegenerate quadratic form $q$, we introduce a polynomial $\mathrm{EDpoly}_{X,u}(t^2)$ which, for any $u\in V$, has among its roots the distance from $u$ to $X$.…

Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…

The delta set of a numerical semigroup $S$, denoted $\Delta(S)$, is a factorization invariant that measures the complexity of the sets of lengths of elements in $S$. We study the following problem: Which finite sets occur as the delta set…

Let $d \in \mathbb{N}$, $\delta \in (0, 1/2)$, and $X > 0$. Denote by $N_d(X, \delta)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $\mathbb{R}^d$ such that every pairwise distance is at least…

The famous Erdos-Heilbronn conjecture plays an important role in the development of additive combinatorics. In 2007 Z. W. Sun made the following further conjecture (which is the linear extension of the Erdos-Heilbronn conjecture): For any…