相关论文: Intersection sizes of linear subspaces with the hy…

It is well known that the only surfaces that are simultaneously minimal in $\mathbb{R}^3$ and maximal in $\mathbb{L}^3$ are open pieces of helicoids (in the region in which they are spacelike) and of spacelike planes (O. Kobayashi 1983).…

Two tantalizing invariants of a combinatorial code $\mathcal C\subseteq 2^{[n]}$ are cdim$(\mathcal C)$ and odim$(\mathcal C)$, the smallest dimension in which $\mathcal C$ can be realized by convex closed or open sets, respectively. Cruz,…

We find explicit formulas for the Hilbert series of residual intersections of a scheme in terms of the Hilbert series of its conormal modules. In a previous paper we proved that such formulas should exist. We give applications to the…

It is known that the $n$-dimensional hypercube $Q_n,$ for $n$ even, has a decomposition into $k$-cycles for $k=n, 2n,$ $2^l$ with $2 \leq l \leq n.$ In this paper, we prove that $Q_n$ has a decomposition into $2^mn$-cycles for $n \geq 2^m.$…

In this paper we present some quantitative results concerning symplectic barriers. In particular, we answer a question raised by Sackel, Song, Varolgunes, and Zhu regarding the symplectic size of the $2n$-dimensional Euclidean ball with a…

A family $\F$ of sets is said to be intersecting if any two sets in $\F$ have nonempty intersection. The celebrated Erd{\H o}s-Ko-Rado theorem determines the size and structure of the largest intersecting family of $k$-sets on an $n$-set…

A family $\mathcal{F}$ on ground set $\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if every collection of $k$ sets in $\mathcal{F}$ has non-empty intersection, and no other set can be added to $\mathcal{F}$ while maintaining this…

We show that any set of distinct homotopy classes of simple closed curves on the torus that pairwise intersect at most $k$ times has size $k + O(\sqrt{k} \log k)$. Prior to this work, a lemma of Agol, together with the state of the art…

We study hyperbolicity for quasi-projective varieties where the boundary divisor consists of n+1 numerically parallel effective divisors on a complex projective variety of dimension n, allowing non-empty intersection. Under explicit local…

Approximation problems involving a single convex body in $d$-dimensional space have received a great deal of attention in the computational geometry community. In contrast, works involving multiple convex bodies are generally limited to…

This paper proves the existence of homeomorphic (diffeomorphic) complex 6-dimensional (7-dim) complete intersections that belong to components of the moduli space of different dimensions. These results are given as a supplement to earlier…

We prove that a subset of the hypercube $(0,1)^d$ with volume sufficiently close to $\frac12$ has (relative) perimeter greater than or equal to $1$. This settles a conjecture by Brezis and Bruckstein. We also prove that, in contrast with…

The maximal density of a measurable subset of R^n avoiding Euclidean distance1 is unknown except in the trivial case of dimension 1. In this paper, we consider thecase of a distance associated to a polytope that tiles space, where it is…

For a hypergraph $\mathcal{H}$, define the minimum positive codegree $\delta_i^+(\mathcal{H})$ to be the largest integer $k$ such that every $i$-set which is contained in at least one edge of $\mathcal{H}$ is contained in at least $k$…

We study an analogue of the Erd\H{o}s-S\'os forbidden intersection problem, for families of linear maps. If $V$ and $W$ are vector spaces over the same field, we say a family $\mathcal{F}$ of linear maps from $V$ to $W$ is…

Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…

The intersection of two orthogonal cylinders represents a classical problem in computational geometry with direct applications to engineering design, manufacturing, and numerical simulation. While analytical solutions exist for the fully…

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings…

Erd\H{o}s asked whether every $n$-point set in Euclidean space whose $\binom{n}{2}$ pairwise distances are mutually at least $1$ apart must have diameter at least $(1+o(1))n^2$. We disprove this statement by constructing for every prime…