Related papers: On the regularity index of the minimum distance fu…

A design is a collection of distinct points in a given set $X$, which is assumed to be a compact subset of $R^d$, and the mesh-ratio of a design is the ratio of its fill distance to its separation radius. The uniformity constant of a…

In this paper, we give estimates of ideal or minimal distances between the distribution of the normalized partial sum and the limiting Gaussian distribution for stationary martingale difference sequences or stationary sequences satisfying…

A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer $m\geq 2$, there are only finitely many…

Let $(X, \Delta)$ be a log pair in characteristic $p>0$ and $P$ be a (not necessarily closed) point of $X$. We show that there exists a constant $\delta>0$ such that $\tau(X, \Delta)_P= \tau(X, \Delta + D)_P$ for each effective…

Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of…

The Douglas-Rachford algorithm can be represented as the fixed point iteration of a firmly nonexpansive operator. When the operator has no fixed points, the algorithm's iterates diverge, but the difference between consecutive iterates…

An identifying code is a subset of vertices of a graph such that each vertex is uniquely determined by its neighbourhood within the identifying code. If $\M(G)$ denotes the minimum size of an identifying code of a graph $G$, it was…

Let $I$ be a homogeneous ideal in a polynomial ring $S$. In this paper, we extend the study of the asymptotic behavior of the minimum distance function $\delta_I$ of $I$ and give bounds for its stabilization point, $r_I$, when $I$ is an…

We devise an analytically simple as well as invertible approximate expression, which describes the relation between the minimum distance of a binary code and the corresponding maximum attainable code-rate. For example, for a rate-(1/4),…

Motivated by applications in combinatorial design theory and constructing LCD codes, C. Ding et al \cite{DLX} introduced cyclic codes $\mho(q,m,h)$ and $\bar\mho(q,m,h)$ over $\mathbb{F}_q$ as new generalization and version of the punctured…

The idea of minimum distance, familiar from R <-> 1/R duality when the string target space is a circle, is analyzed for less trivial geometries. The particular geometry studied is that of a blown-up quotient singularity within a Calabi-Yau…

Let $\Delta_0$ be the Laplace-Beltrami operator on the unit sphere $\mathbb{S}^{d-1}$ of $\mathbb{R}^d$. We show that the Hardy-Rellich inequality of the form $$ \int_{\mathbb{S}^{d-1}} \left | f (x)\right|^2 d\sigma(x) \leq c_d \min_{e\in…

We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…

Let K be a finite field with q elements and let X be a subset of a projective space P^{s-1}, over the field K, which is parameterized by Laurent monomials. Let I(X) be the vanishing ideal of X. Some of the main contributions of this paper…

We first show that the union of a projective curve with one of its extremal secant lines satisfies the linear general position principle for hyperplane sections. We use this to give an improved approximation of the Betti numbers of curves…

Motivated by applications to prediction and forecasting, we suggest methods for approximating the conditional distribution function of a random variable Y given a dependent random d-vector X. The idea is to estimate not the distribution of…

Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…

In recent work, J. Hansen uses cohomological methods to find a lower bound for the minimum distance of an evaluation code determined by a reduced complete intersection in the projective plane. In this paper, we generalize Hansen's results…

We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.

We prove $L^p(b D)$-regularity of the Cauchy-Szeg\H o projection (also known as the Szeg\H o projection) for bounded domains $D\subset\mathbb C^n$ whose boundary satisfies the minimal regularity condition of class $C^2$, together with a…