Related papers: Affine Subspace Statistics in the Hypercube

We consider non-degenerate graph immersions into affine space $\mathbb A^{n+1}$ whose cubic form is parallel with respect to the Levi-Civita connection of the affine metric. There exists a correspondence between such graph immersions and…

We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k…

If $c, \overline c\colon [a,b]\to \mathbb R^2$ are two convex planar curve parameterized by affine arc length and $A\colon [a,b]\to [0,\infty)$ is the area bounded by the restriction $c\big|_{[a,s]}$ and the segment between $c(a)$ and…

Alon and F\"{u}redi (1993) showed that the number of hyperplanes required to cover $\{0,1\}^n\setminus \{0\}$ without covering $0$ is $n$. We initiate the study of such exact hyperplane covers of the hypercube for other subsets of the…

For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph…

The Fermi surface topology of the organic superconductor \lbets has been determined using the Shubnikov-de Haas and magnetic breakdown effects and angle-dependent magnetoresistance oscillations. The former experiments were carried out in…

Given $m$ points and $n$ hyperplanes in $\mathbb{R}^d$, if there are many incidences, we expect to find a big cluster $K_{r,s}$ in their incidence graph. Apfelbaum and Sharir found lower and upper bounds for the largest size of $rs$, which…

Let an indirectly measurable variable be represented as a function of a finite number of directly measurable variables . In our previous researches we: 1) represented the maximum inaccuracies of in first degree of approximation as linear…

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.…

Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.

The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and…

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

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)$…

We provide probabilistic lower bounds for the star discrepancy of Latin hypercube samples. These bounds are sharp in the sense that they match the recent probabilistic upper bounds for the star discrepancy of Latin hypercube samples proved…

In the framework of light-cone gauge formulation, massless arbitrary spin N=1 supermultiplets in four-dimensional flat space are considered. We study both the integer (super)spin and half-integer (super)spin supermultiplets. For such…

A hypergraph $\mathcal{F}$ is non-trivial intersecting if every two edges in it have a nonempty intersection but no vertex is contained in all edges of $\mathcal{F}$. Mubayi and Verstra\"{e}te showed that for every $k \ge d+1 \ge 3$ and $n…

We introduce an explicit construction that produces immersions into the pseudosphere $\mathbb{S}^{n,n+1}$ and the pseudohyperbolic space $\mathbb{H}^{n+1,n}$ starting from equiaffine immersions in $\mathbb{R}^{n+1}$, and conversely. We…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

For the pure $\psi$-class intersection numbers $D(\textbf{e})=\langle \tau_{e_1} \cdots \tau_{e_n} \rangle_g$ on the moduli space $\overline{\mathcal{M}}_{g,n}$ of stable curves, we determine for which choices of $\textbf{e}=(e_1, \ldots,…

We describe holographic properties of near-AdS$_2$ spacetimes that arise within spherically symmetric configurations of ${\cal N}=2$ 4D $U(1)^4$ supergravity, for both gauged and ungauged theories. These theories pose a rich space of…