相关论文: A note on rich lines in truly high dimensional set…

Denoting by ${\mathcal L}_d(m_0,m_1,...,m_r)$ the linear system of plane curves passing through $r+1$ generic points $p_0,p_1,...,p_r$ of the projective plane with multiplicity $m_i$ (or larger) at each $p_i$, we prove the…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

In 1975 Lov\'{a}sz conjectured that every $r$-partite, $r$-uniform hypergraph contains $r-1$ vertices whose deletion reduces the matching number. If true, this statement would imply a well-known conjecture of Ryser from 1971, which states…

A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…

A graph has strong convex dimension $2$, if it admits a straight-line drawing in the plane such that its vertices are in convex position and the midpoints of its edges are also in convex position. Halman, Onn, and Rothblum conjectured that…

The Morse-Sard theorem requires that a mapping $v:R^n \to R^m$ is of class $C^k$, $k>n-m$. In 1957 Dubovitski\u{\i} generalized this result by proving that almost all level sets for a $C^k$ mapping have $H^s$-negligible intersection with…

We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…

For $d \ge 2$, we show that all graphs of $d$-polytopes have a Hamiltonian line graph if and only if $d \ne 3$: We exhibit a graph of a $3$-polytope on $252$ vertices whose line graph does not even have Hamiltonian paths. Adapting a…

Let $B$ and $R$ be point sets (of {\em blue} and {\em red} points, respectively) in the plane, such that $P:=B\cup R$ is in general position, and $|P|$ is even. A line $\ell$ is {\em balanced} if it spans one blue and one red point, and on…

We consider the closed locus of $r$-tuples of hypersurfaces in $\mathbb{P}^r$ with positive dimensional intersection, and show in a large range of degrees that its largest component is the locus of $r$-tuples of hypersurfaces whose…

Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…

In this article we verify an orbifold version of a conjecture of Nimershiem from 1998. Namely, for every flat $n$-manifold $M$, we show that the set of similarity classes of flat metrics on $M$ which occur as a cusp cross-section of a…

Fix integers $d,r\ge 2$ and suppose that the edge set of the $d$-fold Cartesian product of the $N$-clique $K_N^d$ is $r$-colored. We show that there is a copy of $K_n^d$ whose edges in each direction are monochromatic provided $N > 2^{2^{c…

Hadwiger's transversal theorem gives necessary and sufficient conditions for the existence of a line transversal to a family of pairwise disjoint convex sets in the plane. These conditions were subsequently generalized to hyperplane…

The classical Ham Sandwich theorem states that any $d$ point sets in $\mathbb{R}^d$ can be simultaneously bisected by a single affine hyperplane. A generalization of Dolnikov asserts that any $d$ families of pairwise intersecting compact,…

A family of $k$-subsets $A_1, A_2, ..., A_d$ on $[n]=\{1,2,..., n\}$ is called a $(d, c)$-cluster if the union $A_1\cup A_2 \cup ... \cup A_d$ contains at most $ck$ elements with $c<d$. Let $\mathcal{F}$ be a family of $k$-subsets of an…

If C and D are varieties of algebras in the sense of general algebra, then by a representable functor C --> D we understand a functor which, when composed with the forgetful functor D --> Set, gives a representable functor in the classical…

We prove that every class of graphs $\mathscr C$ that is monadically stable and has bounded twin-width can be transduced from some class with bounded sparse twin-width. This generalizes analogous results for classes of bounded linear…

The $r$-uniform linear $k$-cycle $C^r_k$ is the $r$-uniform hypergraph on $k(r-1)$ vertices whose edges are sets of $r$ consecutive vertices in a cyclic ordering of the vertex set chosen in such a way that every pair of consecutive edges…

Let d_{k,n} and #_{k,n} denote the dimension and the degree of the Grassmannian G_{k,n} of k-planes in projective n-space, respectively. For each k between 1 and n-2 there are 2^{d_{k,n}} \cdot #_{k,n} (a priori complex) k-planes in P^n…