Related papers: Upper bounds for partial spreads

The leading, planar diagrams of the $1/N_c$ expansion and the usual string description suggest that quarks propagate on the boundary of a two-dimensional world surface. We restrict the quarks to the boundary of the world surface by giving…

The spread of a graph $G$ is the difference between the largest and smallest eigenvalue of the adjacency matrix of $G$. In this paper, we consider the family of graphs which contain no $K_{s,t}$-minor. We show that for any $t\geq s \geq 2$…

Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…

We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…

We improve known upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and non-periodic settings. Some of our bounds are sharp up to logarithmic factors.

The intersection distribution of a polynomial $f$ over finite field $\mathbb{F}_q$ was recently proposed in Li and Pott (arXiv:2003.06678v1), which concerns the collective behaviour of a collection of polynomials $\{f(x)+cx \mid c \in…

We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergraphs, a class commonly found in applications dealing with data. Let H be such a hypergraph on a set of vertices V. We give a lower bound of…

Let $V$ be a finite dimensional vector space over a finite field, and $\mathcal{F}$ a family consisting of $k$-subspaces of $V$. The family $\mathcal{F}$ is called $t$-intersecting if $\dim(F_{1}\cap F_{2})\geq t$ for any $F_{1}, F_{2}\in…

Recently, a lower bound was established on the size of linear sets in projective spaces, that intersect a hyperplane in a canonical subgeometry. There are several constructions showing that this bound is tight. In this paper, we generalize…

In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a…

Given disjoint subsets $T_1,\ldots,T_m$ of "not too large" primes up to $x$, we establish that for a random integer $n$ drawn from $[1,x]$, the $m$-dimensional vector enumerating the number of prime factors of $n$ from $T_1,\ldots,T_m$…

We continue the study of the fine properties of sets having locally finite distributional fractional perimeter. We refine the characterization of their blow-ups and prove a Leibniz rule for the intersection of sets with locally finite…

Generalized entropies and relative entropies are the subject of active research. Similar to the standard relative entropy, the relative $q$-entropy is generally unbounded for $q>1$. Upper bounds on the quantum relative $q$-entropy in terms…

Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…

In this paper, we study flag codes on the vector space $\mathbb{F}_q^n$, being $q$ a prime power and $\mathbb{F}_q$ the finite field of $q$ elements. More precisely, we focus on flag codes that attain the maximum possible distance (optimum…

Let $q,d\geq 2$ be integers. Define $$ J(q,d):=\frac 1q \Big( \min_{0<x<1} \frac{1-x^q}{1-x} x^{-\frac{q-1}{d}}\Big). $$ Let $\mbox{$\cal G$}\subseteq {\mathbb R}^n$ be an arbitrary subset. We denote by $d(\mbox{$\cal G$})$ the set of…

For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of distinct, nonzero roots of $f$ is bounded above by $2 (q-1)^{1-\varepsilon} C^\varepsilon$, where $\varepsilon = 1/(t-1)$ and $C$ is the…

Let $G_n$ be a non-extensible, flexible closed curve of length $n$ in the 3-space $\R^3$ with $n$ particles $A_1$,...,$A_n$ evenly fixed (according to the arc length of $G_n$) on the curve. Let $f:(0, \infty)\to \R$ be an increasing and…

Let $\alpha(\mathbb{F}_q^{d},p)$ be the maximum possible size of a point set in general position in the $p$-random subset of $\mathbb{F}_q^d$. In this note, we determine the order of magnitude of $\alpha(\mathbb{F}_q^{3},p)$ up to a…

For spherical and parabolic averages of the Fourier transform of fractal measures, we obtain new upper bounds on rates of decay by an "intermediate dimension" trick.