相关论文: Distances between the conjugates of an algebraic n…

An upper bound for Zolotarev distances between probability measures on multidimensional Euclidean spaces is given in terms of similar distances between one dimensional projections.

This paper presents a distance function between sets based on an average of distances between their elements. The distance function is a metric if the sets are non-empty finite subsets of a metric space. It can be applied to produce various…

We introduce compactness classes of Hilbert space operators by grouping together all operators for which the associated singular values decay at a certain speed and establish upper bounds for the norm of the resolvent of operators belonging…

Let $K/\mathbb{Q}$ be an algebraic extension of fields, and let $\alpha \not= 0$ be contained in an algebraic closure of $K$. If $\alpha$ can be approximated by roots of numbers in $K^{\times}$ with respect to the Weil height, we prove that…

For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…

We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…

A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic…

Let $K$ be a field and $n\geq 3$. Let $E_n(K)\leq H\leq GL_n(K)$ be an intermediate group and $C$ a noncentral $H$-class. Define $m(C)$ as the minimal positive integer $m$ such that $\exists i_1,\dots,i_m\in\{\pm 1\}$ such that the product…

In this work we investigate unions of lifted MRD codes of a fixed dimension and minimum distance and derive an explicit formula for the cardinality of such codes. This will then imply a lower bound on the cardinality of constant dimension…

We define a special network that exhibits the large embeddings in any class of similar algebras. With the aid of this network, we introduce a notion of distance that conceivably counts the minimum number of dissimilarities, in a sense,…

We prove that there exists a norm in the plane under which no n-point set determines more than O(n log n log log n) unit distances. Actually, most norms have this property, in the sense that their complement is a meager set in the metric…

We obtain lower bound of caliber number of real quadratic field $K=\FQ(\sqrt{d})$ using splitting primes in $K$. We find all real quadratic fields of caliber number 1 and find all real quadratic fields of caliber number 2 if $d$ is not 5…

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

In this paper, we use some of our previous results to improve an upper bound of Bayer-Fluckiger, Borello and Jossen on the Euclidean minima of algebraic number fields. Our bound depends on the degree $n$ of the field, its signature,…

For an abelian variety $A$ over a number field we study bounds depending only on the dimension of $A$ for the minimal degree $d(A)$ of a field extension over which $A$ acquires semi-stable reduction. We first compute $d(A)$ in terms of the…

A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show…

We determine the set of catenary degrees, the set of distances, and the unions of sets of lengths of the monoid of nonzero ideals and of the monoid of invertible ideals of orders in quadratic number fields.

For $d\geq 2$ and any norm on $\mathbb R^d$, we prove that there exists a set of $n$ points that spans at least $(\tfrac d2-o(1))n\log_2n$ unit distances under this norm for every $n$. This matches the upper bound recently proved by Alon,…

Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum…

It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…