Related papers: Maximal Non-Exchangeability in Dimension d

Hardy's paradox is of fundamental importance in quantum information theory. So far, there have been two types of its extensions into higher dimensions: in the first type the maximum probability of nonlocal events is roughly $9\%$ and…

In this paper, we analyze $m$-dimensional ($m$D) convolutional codes with finite support, viewed as a natural generalization of one-dimensional (1D) convolutional codes to higher dimensions. An $m$D convolutional code with finite support…

We survey permutation-based methods for approximate k-nearest neighbor search. In these methods, every data point is represented by a ranked list of pivots sorted by the distance to this point. Such ranked lists are called permutations. The…

This article introduces the novel notion of dimension preserving approximation for continuous functions defined on $[0,1]$ and initiates the study of it. Restrictions and extensions of continuous functions in regards to fractal dimensions…

An $[n,k,d]$ linear code is said to be maximum distance separable (MDS) or almost maximum distance separable (AMDS) if $d=n-k+1$ or $d=n-k$, respectively. If a code and its dual code are both AMDS, then the code is said to be near maximum…

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

We say that a set of points $S\subset \mathbb{R}^d$ is an $\varepsilon$-nearly $k$-distance set if there exist $1\le t_1\le \ldots\le t_k,$ such that the distance between any two distinct points in $S$ falls into…

Let $N(d,d^\perp)$ denote the minimum length $n$ of a linear code $C$ with $d$ and $d^{\bot}$, where $d$ is the minimum Hamming distance of $C$ and $d^{\bot}$ is the minimum Hamming distance of $C^{\bot}$. In this paper, we show a lower…

The classical action of a two dimensional N=2 supersymmetric theory, characterized by a general K\"{a}hler potential, is written down on a non(anti)commutative superspace. The action has a power series expansion in terms of the determinant…

We consider avoidance of permutation patterns with designated gap sizes between pairs of consecutive letters. We call the patterns having such constraints distant patterns (DPs) and we show their relation to other pattern notions…

In a recent paper the author obtained optimal bounds for the strong Gaussian approximation of sums of independent $\R^d$-valued random vectors with finite exponential moments. The results may be considered as generalizations of well-known…

Let A_N be an N-point distribution in the unit square in the Euclidean plane. We consider the Discrepancy function D_N(x) in two dimensions with respect to rectangles with lower left corner anchored at the origin and upper right corner at…

A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…

In dimension $n=1$ we obtain $L^{p_1}(\mathbb R) \times\dots\times L^{p_m}(\mathbb R)$ to $L^p(\mathbb R)$ boundedness for the multilinear spherical maximal function in the largest possible open set of indices and we provide counterexamples…

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

The following generalisation of the Erd\H{o}s unit distance problem was recently suggested by Palsson, Senger and Sheffer. Given $k$ positive real numbers $\delta_1,\dots,\delta_k$, a $(k+1)$-tuple $(p_1,\dots,p_{k+1})$ in $\mathbb{R}^d$ is…

The dispersion of a point set in $[0,1]^d$ is the volume of the largest axis parallel box inside the unit cube that does not intersect with the point set. We study the expected dispersion with respect to a random set of $n$ points…

We study the asymptotic behaviour of the maximum interpoint distance of random points in a planar bounded set with an unique major axis and a boundary behaving like an ellipse at the endpoints. Our main result covers the case of uniformly…

In this paper we prove that among all convex domains of the plane with two axis of symmetry, the maximizer of the first non trivial Neumann eigenvalue $\mu_1$ with perimeter constraint is achieved by the square and the equilateral triangle.…

Let $K$ be a field and let $V$ be a vector space of dimension $n$ over $K$. Let $M$ be a subspace of bilinear forms defined on $V\times V$. Let $r$ be the number of different non-zero ranks that occur among the elements of $M$. Our aim is…