Related papers: Intersection sizes of linear subspaces with the hy…

We derive some estimates for stable minimal hypersurfaces in $R^{n+1}$. The estimates are related to recent proofs of Bernstein theorems for complete stable minimal hypersurfaces in $R^{n+1}$ for $3\le n\le 5$ by Chodosh-Li,…

We prove that a complete intersection of $c$ very general hypersurfaces of degree at least two in $N$-dimensional complex projective space is not ruled (and therefore not rational) provided that the sum of the degrees of the hypersurfaces…

We prove that a Fano complete intersection of codimension $k$ and index 1 in the complex projective space ${\mathbb P}^{M+k}$ for $k\geqslant 20$ and $M\geqslant 8k\log k$ with at most multi-quadratic singularities is birationally…

This note shows that an interesting property arises when considering the relation between the hypersphere volumes at dimensions $n+1$ and $n$, if the hyperspheres circumscribe unitary hypercubes in $n+1$ and $n$ dimensions, respectively .…

We examine the dimensions of the intersection of a subset $E$ of an $m$-ary Cantor space $\mathcal{C}^m$ with the image of a subset $F$ under a random isometry with respect to a natural metric. We obtain almost sure upper bounds for the…

We resolve a long-standing conjecture of Wilson (2004), reiterated by Oliveira (2016), asserting that the mixing-time of the unit-rate Interchange Process on the $n$-dimensional hypercube is of order $n$. This follows from a sharp…

Conditions, related to the so-called bending problem are considered for hypersurfaces of a pseudo-Euclidean space. Corresponding theorems are proved.

The maximum size of $t$-intersecting families is one of the most celebrated topics in combinatorics, and its size is known as the Erd\H{o}s-Ko-Rado theorem. Such intersecting families, also known as constant-weight anticodes in coding…

Let $X\subset \mathbb{P}^{2k+1}$ be a smooth hypersurface containing two k-dimensional linear spaces $\Pi_1,\Pi_2$ intersecting in codimension one. In this paper we study the question whether the Hodge loci $NL([\Pi_1]+\lambda[\Pi_2])$ and…

Intersection numbers for subspace designs are introduced and $q$-analogs of the Mendelsohn and K\"ohler equations are given. As an application, we are able to determine the intersection structure of a putative $q$-analog of the Fano plane…

Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially…

This paper introduces a new variant of hypercubes, which we call Z-cubes. The n-dimensional Z-cube $H_n$ is obtained from two copies of the (n-1)-dimensional Z-cube $H_{n-1}$ by adding a special perfect matching between the vertices of…

In this work we reproduce the characterization of $\Gg^s$-sets from the euclidean setting [J. London Math. Soc. 49:267-280,1994] to more general metric spaces. These sets have Hausdorff dimension at least $s$ and are closed by countable…

A set partition is $c$-uniform if every block has size $c$. Two families of $c$-uniform partitions of a finite set are said to be cross $t$-intersecting if two partitions from different families share at least $t$ blocks. In this paper, we…

Let M be a closed embedded minimal hypersurface in a Euclidean sphere of dimension n+1, we prove that it is strongly rigid. As applications we confirm the conjecture proposed by Choi and Schoen in [3] and the Chern conjecture for n less…

Let $\mathcal{Q}_1$ and $\mathcal{Q}_2$ be two arbitrary quadrics with no common hyperplane in ${\mathbb{P}}^n(\mathbb{F}_q)$. We give the best upper bound for the number of points in the intersection of these two quadrics. Our result…

Let H be a 3-uniform hypergraph of order n with clique number k such that the intersection of all maximum cliques of H is empty. For fixed m=n-k, Szemer\'edi and Petruska conjectured the sharp bound $n\leq {m+2\choose 2}$. In this note the…

We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…

A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…

We write supersymmetry preserving conditions for infinite M5-branes intersecting on a (3+1)-dimensional space. In contrast to previously known solutions, these intersections are completely localized. We solve the equations for a particular…