Related papers: Spectral gaps, missing faces and minimal degrees

R\"odl, Ruci\'nski, and Szemer\'edi determined the minimum $(k-1)$-degree threshold for the existence of fractional perfect matchings in $k$-uniform hypergrahs, and K\"uhn, Osthus, and Townsend extended this result by asymptotically…

For a nonnegative integer $k$, a graph $G$ is said to be $k$-factor-critical if $G-Q$ admits a perfect matching for any $Q\subseteq V(G)$ with $|Q|=k$. In this article, we prove spectral radius conditions for the existence of…

This paper concerns the facial geometry of the set of $n \times n$ correlation matrices. The main result states that almost every set of $r$ vertices generates a simplicial face, provided that $r \leq \sqrt{\mathrm{c} n}$, where…

The bidimensionality of a set of vertices $X$ in a graph $G$ is the maximum $k$ for which $G$ contains as a $X$-rooted minor the $(k \times k)$-grid. This notion allows for the following version of the Graph Minors Structure Theorem (GMST)…

Let $G$ be a finite group of order $n$ and for $1 \leq i \leq k+1$ let $V_i=\{i\} \times G$. Viewing each $V_i$ as a $0$-dimensional complex, let $Y_{G,k}$ denote the simplicial join $V_1*\cdots*V_{k+1}$. For $A \subset G$ let $Y_{A,k}$ be…

Let $A$ be a complex semisimple Banach algebra with identity, and denote by $\sigma'(x)$ and $\rho (x)$ the nonzero spectrum and spectral radius of an element $x \in A$, respectively. We explore the relationship between elements $a, b \in…

In this paper, we present a sharp upper bound for the spectral radius of an $n$-vertex graph without $F$-minor for sufficient large $n$, where $F$ is obtained from the complete graph $K_r$ by deleting disjointed paths. Furthermore, the…

Let $S$ be a $k$-colored (finite) set of $n$ points in $\mathbb{R}^d$, $d\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic…

We introduce a filtration on the simplicial homology of a finite simplicial complex X using bi-colourings of its vertices. This yields two dual homology theories closely related to discrete Morse matchings on X. We give an explicit…

We generalize the following result of White: Suppose $N$ is a compact, strictly convex domain in $\RR^3$ with smooth boundary. Let $\Sigma$ be a compact 2-manifold with boundary. Then a generic smooth curve $\Gamma\cong \partial\Sigma$ in…

In [Ho] A.J. Hoffman proved a lower bound on the chromatic number of a graph in the terms of the largest and the smallest eigenvalues of its adjacency matrix. In this paper, we prove a higher dimensional version of this result and give a…

In 1967, Gr\"unbaum conjectured that the function $$ \phi_k(d+s,d):=\binom{d+1}{k+1}+\binom{d}{k+1}-\binom{d+1-s}{k+1},\; \text{for $2\le s\le d$} $$ provides the minimum number of $k$-faces for a $d$-dimensional polytope (abbreviated as a…

Let (M,g,J) be a compact Hermitian manifold with a smooth boundary. Let $\Delta_p$ and $D_p$ be the realizations of the real and complex Laplacians on p forms with either Dirichlet or Neumann boundary conditions. We generalize previous…

We survey some recent results on the minimal graded free resolution of a square-free monomial ideal. The theme uniting these results is the point-of-view that the generators of a monomial ideal correspond to the maximal faces (the facets)…

Given any asymptotically flat 3-manifold $(M,g)$ with smooth, non-empty, compact boundary $\Sigma$, the conformal conjecture states that for every $\delta>0$, there exists a metric $g' = u^4 g$, with $u$ a harmonic function, such that the…

A simplicial complement P is a sequence of subsets of [m] and the simplicial complement P corresponds to a unique simplicial complex K with vertices in [m]. In this paper, we defined the homology of a simplicial complement…

Let $\mathcal{D}_k$ be the class of graphs for which every minor has minimum degree at most $k$. Then $\mathcal{D}_k$ is closed under taking minors. By the Robertson-Seymour graph minor theorem, $\mathcal{D}_k$ is characterised by a finite…

In this paper we show that if a compact set $E \subset \mathbb{R}^d$, $d \geq 3$, has Hausdorff dimension greater than $\frac{(4k-1)}{4k}d+\frac{1}{4}$ when $3 \leq d<\frac{k(k+3)}{(k-1)}$ or $d- \frac{1}{k-1}$ when $\frac{k(k+3)}{(k-1)}…

We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the…

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[m]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [m]$ of $[m]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…