Related papers: Affine Subspace Statistics in the Hypercube

For every $n \in \mathbb{N}$ and every field $K$, let $A(n,K)$ be the vector space of the antisymmetric $(n \times n)$-matrices over $K$. We say that an affine subspace $S$ of $A(n,K)$ has constant rank $r$ if every matrix of $S$ has rank…

In this paper we investigate the intersection problem for $1$-surfaces immersed in a complete Riemannian three-manifold $P$ with Ricci curvature bounded from below by $-2$. We first prove a Frankel's type theorem for $1$-surfaces with…

We present a technique for deriving lower bounds for incidences with hypersurfaces in ${\mathbb R}^d$ with $d\ge 4$. These bounds apply to a large variety of hypersurfaces, such as hyperplanes, hyperspheres, paraboloids, and hypersurfaces…

For positive integers $n$ and $r$, we let $Q_n^r$ denote the $r$th power of the $n$-dimensional discrete hypercube graph, i.e., the graph with vertex-set $\{0,1\}^n$, where two 0-1 vectors are joined if they are Hamming distance at most $r$…

A hypergraph is \textit{bipartite with bipartition $(A, B)$} if every edge has exactly one vertex in $A$, and a matching in such a hypergraph is \textit{$A$-perfect} if it saturates every vertex in $A$. We prove an upper bound on the number…

Given the $r$-distance graph on the hypercube $\mathbb{F}_2^n$, where two vertices are adjacent if their Hamming distance is exactly $r$, we study the maximum size $T(n,r)$ of a triangle-free set of vertices. For even $r\le n/2$, we prove…

We study the dynamics of the one-dimensional quasi-affine map $x\mapsto \left\lfloor \lambda x +\mu \right\rfloor$, providing a complete description of the map's periodic points, and of the limit points of every $x\in\mathbb{R}$ under the…

Consider irrational affine subspace $ A\subset \mathbb{R}^d$ of dimension $a$. We prove that the set $$ \{\xi =(\xi_1,...,\xi_d) \in {A}:\,\,\, \ q^{1/a}\cdot \max_{1\le i \le d} ||q\xi_i|| \to \infty,\,\,\,\, q\to \infty\} $$ is an…

Let $2\leq m < n$ and $q \in (1,\infty)$, we denote by $W^mL^{\frac nm,q}(\mathbb H^n)$ the Lorentz-Sobolev space of order $m$ in the hyperbolic space $\mathbb H^n$. In this paper, we establish the following Adams inequality in the…

A distance magic labeling of an $n$-dimensional hypercube is a labeling of its vertices by natural numbers from $\{0, \ldots, 2^n-1\}$, such that for all vertices $v$ the sum of the labels of the neighbors of $v$ is the same. Such a…

Erd\H{o}s and Lov\'asz noticed that an $r$-uniform intersecting hypergraph $H$ with maximal covering number, that is $\tau(H)=r$, must have at least $\frac{8}{3}r-3$ edges. There has been no improvement on this lower bound for 45 years. We…

Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there are approximation algorithms known in the offline setting.…

The emergent phenomena such as superconductivity and topological phase transitions can be observed in strict two-dimensional crystalline matters. Artificial interfaces and one atomic thickness layers are typical 2D materials of this kind.…

Eberhard and Pohoata conjectured that every $3$-cube-free subset of $[N]$ has size less than $2N/3+o(N)$. In this paper we show that if we replace $[N]$ with $\mathbb{Z}_N$ the upper bound of $2N/3$ holds, and the bound is tight when $N$ is…

It has been conjectured that a complete set of mutually unbiased bases in a space of dimension d exists if and only if there is an affine plane of order d. We introduce affine constellations and compare their existence properties with those…

By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…

Let $Q_n = \{0, 1\}^n$ be a hypercube graph. The initial segment $I_k \subseteq Q_n$ is the subset consisting of the first $k$ vertices of $Q_n$ in the binary order. A pair of integers $(a, b) \in \mathbb{Z}_{>0}^2$ is said to be fit if,…

We consider the problem of orienting the edges of the $n$-dimensional hypercube so only two different in-degrees $a$ and $b$ occur. We show that this can be done, for two specified in-degrees, if and only if an obvious necessary condition…

We show that the vertices and edges of a $d$-dimensional grid graph $G=(V,E)$ ($d\geqslant 2$) can be labeled with the integers from $\{1,\ldots,\lvert V\rvert\}$ and $\{1,\ldots,\lvert E\rvert\}$, respectively, in such a way that for every…

In this thesis, the AdS/CFT correspondence is used as a tool to explore novel AdS$_5$ Supergravity backgrounds (containing five-dimensional Anti-de Sitter spacetime) and their dual (four dimensional) Conformal Field Theory descriptions. In…