Related papers: Maximal Non-Exchangeability in Dimension d

The mechanism of dimensional transmutation is discussed in the context of Maxwell-Chern-Simons scalar QED. The method used is non-perturbative. The effective potential describes a broken symmetry state. It is found that the symmetry…

We show that if the Banach-Mazur distance between an n-dimensional normed space X and ell infinity is at most 3/2, then there exist n+1 equidistant points in X. By a well-known result of Alon and Milman, this implies that an arbitrary…

An (n,d) permutation array (PA) is a set of permutations of length n with the property that the distance (under some metric) between any two permutations in the array is at least d. They became popular recently for communication over power…

We show that for almost any vector $v$ in $\mathbb{R}^n$, for any $\epsilon>0$ there exists $\delta>0$ such that the dimension of the set of vectors $w$ satisfying $\liminf_{k\to\infty} k^{1/n}<kv-w> \ge \epsilon$ (where $<\cdot>$ denotes…

We consider the average distance between four bases in dimension six. The distance between two orthonormal bases vanishes when the bases are the same, and the distance reaches its maximal value of unity when the bases are unbiased. We…

Let $\mathbb{F}_q$ be a finite field of order $q$. Iosevich and Rudnev (2005) proved that for any set $A\subset \mathbb{F}_q^d$, if $|A|\gg q^{\frac{d+1}{2}}$, then the distance set $\Delta(A)$ contains a positive proportion of all…

We make four contributions to the theory of optimal subspace packings and equi-isoclinic subspaces: (1) a new lower bound for block coherence, (2) an exact count of equi-isoclinic subspaces of even dimension $r$ in $\mathbb{R}^{2r+1}$ with…

Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…

We study the problem of computing the \textsc{Maxima} of a set of $n$ $d$-dimensional points. For dimensions 2 and 3, there are algorithms to solve the problem with order-oblivious instance-optimal running time. However, in higher…

The Bernoulli convolution $\nu_\lambda$ with parameter $\lambda\in(0,1)$ is the probability measure supported on $\mathbf{R}$ that is the law of the random variable $\sum\pm\lambda^n$, where the $\pm$ are independent fair coin-tosses. We…

We present a counter-example to the recent claim that supermultiplets of N-extended supersymmetry with no central charge and in 1-dimension are specified unambiguously by providing the numbers of component fields in all available…

We define the lower and upper mutual dimensions $mdim(x:y)$ and $Mdim(x:y)$ between any two points $x$ and $y$ in Euclidean space. Intuitively these are the lower and upper densities of the algorithmic information shared by $x$ and $y$. We…

We study the Steklov problem on hypersurfaces of revolution with two boundary components in Euclidean space. In a recent article, the phenomenon of critical length, at which a Steklov eigenvalue is maximized, was exhibited and multiple…

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

For any adic transformation $T$ defined on the path space $X$ of an ordered Bratteli diagram, endowed with a Markov measure $\mu$, we construct an explicit dimension space (which corresponds to a matrix values random walk on $\mathbb{Z}$)…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

For arbitrary two probability measures on real d-space with given means and variances (covariance matrices), we provide lower bounds for their total variation distance. In the one-dimensional case, a tight bound is given.

Numerical evidence suggests that certain permutation patterns of length k are easier to avoid than any other patterns of that same length. We prove that these patterns are avoided by no more than (2.25k^2)^n permutations of length n. In…

Let $\gamma_1,\gamma_2$ be a pair of constant-degree irreducible algebraic curves in $\mathbb{R}^d$. Assume that $\gamma_i$ is neither contained in a hyperplane nor in a quadric surface in $\mathbb{R}^d$, for each $i=1,2$. We show that for…

Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum…