Related papers: On the gap between representability and collapsibi…

Let $\mathcal{H}$ be a hypergraph of rank $r$. We show that the simplicial complex whose simplices are the hypergraphs $\mathcal{F}\subset\mathcal{H}$ with covering number at most $p$ is $\left(\binom{r+p}{r}-1\right)$-collapsible, and the…

Let $G$ be a real reductive Lie group, $L$ a compact subgroup, and $\pi$ an irreducible admissible representation of $G$. In this article we prove a necessary and sufficient condition for the finiteness of the multiplicities of $L$-types…

In this article, we will explore the fundamental concepts, including various basic concepts on $d$-complex manifolds, along with several differential operators and examine the relationships between them. A $d$-K\"ahler manifold is a…

We study $S$-convex sets, which are the geometric objects obtained as the intersection of the usual convex sets in $\mathbb R^d$ with a proper subset $S\subset \mathbb R^d$. We contribute new results about their $S$-Helly numbers. We extend…

We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer.…

Let $K$ be a finitely generated field. We construct an $n$-dimensional linear system $\mathcal{L}$ of hypersurfaces of degree $d$ in $\mathbb{P}^n$ defined over $K$ such that each member of $\mathcal{L}$ defined over $K$ is smooth, under…

We call a finite-dimensional K-algebra A geometrically irreducible if for all d, all connected components of the affine scheme of d-dimensional A-modules are irreducible. We show that the geometrically irreducible algebras without loops…

Let X be a smooth hypersurface of degree d in P^n over an algebraically closed field of characteristic p. We show that X must be separably rationally connected and must contain a free line if either p is at least d or if p is at least d-1…

We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…

Let $V$ be a finite dimensional complex vector space and $W\subset \GL(V)$ be a finite complex reflection group. Let $V^{\reg}$ be the complement in $V$ of the reflecting hyperplanes. A classical conjecture predicts that $V^{\reg}$ is a…

The 1913 Helly's theorem states that any family ${\cal K}$ of $n\geq d+1$ convex sets in ${\mathbb R}^d$ can be pierced by a single point if and only if any $d+1$ of ${\cal K}$'s elements can. In 2002 Alon, Kalai, Matou\v{s}ek and Meshulam…

Consider a finite system of non-strict polynomial inequalities with solution set $S\subseteq\mathbb R^n$. Its Lasserre relaxation of degree $d$ is a certain natural linear matrix inequality in the original variables and one additional…

Neural representations are not unique objects. Even when two systems realize the same downstream computation, their hidden coordinates may differ by reparameterization. A probe family intended to reveal structure already present in a…

Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…

In this paper we study generalizations of classical results on intersection patterns of set systems in $\mathbb{R}^d$, such as the fractional Helly theorem or the $(p,q)$-theorem, in the setting of arbitrary triangulable spaces with a…

The colorful Helly theorem and Tverberg's theorem are fundamental results in discrete geometry. We prove a theorem which interpolates between the two. In particular, we show the following for any integers $d \geq m \geq 1$ and $k$ a prime…

Kalai conjectured that if $P$ is a simplicial $d$-polytope that has no missing faces of dimension $d-1$, then the graph of $P$ and the space of affine $2$-stresses of $P$ determine $P$ up to affine equivalence. We propose a…

A d-dimensional simplex S is called a k-reptile if it can be tiled without overlaps by simplices S_1,S_2,...,S_k that are all congruent and similar to S. For d=2, k-reptile simplices (triangles) exist for many values of k and they have been…

For a set of distances D={d_1,...,d_k} a set A is called D-avoiding if no pair of points of A is at distance d_i for some i. We show that the density of A is exponentially small in k provided the ratios d_1/d_2, d_2/d_3, ..., d_{k-1}/d_k…

We prove that any convex geometry $\mathcal{A}=(U,\mathcal{C})$ on $n$ points and any ideal $\mathcal{I}=(U',\mathcal{C}')$ of $\mathcal{A}$ can be realized as the intersection pattern of an open convex polyhedral cone $K\subseteq {\mathbb…