Related papers: Lower Bounds for Buchsbaum* Complexes
This paper extends results of Hatcher and Vogtmann's work "Cerf Theory for Graphs" to ribbon graphs. Given an orientable, punctured and basepointed surface Sigma, we prove that the space of ribbon graphs that can be drawn in Sigma is…
Arithmetic complexity is considered simpler to understand than Boolean complexity, namely computing Boolean functions via logical gates. And indeed, we seem to have significantly more lower bound techniques and results in arithmetic…
We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…
In this manuscript, we work over the non-chain ring $\mathcal{R} = \mathbb{F}_2[u]/\langle u^3 - u\rangle $. Let $m\in \mathbb{N}$ and let $L, M, N \subseteq [m]:=\{1, 2, \dots, m\}$. For $X\subseteq [m]$, define $\Delta_X:=\{v \in…
We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…
Let $d \geq 4$ be a natural number and let $A$ be a finite, non-empty subset of $\mathbb{R}^d$ such that $A$ is not contained in a translate of a hyperplane. In this setting, we show that \[ |A-A| \geq \bigg(2d - 2 + \frac{1}{d-1} \bigg)…
Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…
In this paper we inititate the study of abstract simplicial complexes which are initial segments of qualitative probability orders. This is a natural class that contains the threshold complexes and is contained in the shifted complexes, but…
We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…
We obtain explicit branching rules for graded cell modules and graded simple modules over the endomorphism algebra of a Bott-Samelson bimodule. These rules allow us to categorify a well-known recursive formula for Kazhdan-Lusztig…
Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…
We present two new problems on lower bounds for resolution Betti numbers of monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are…
In this paper we establish a natural definition of Lusternik-Schnirelmann category for simplicial complexes via the well known notion of contiguity. This category has the property of being homotopy invariant under strong equivalences, and…
Let R be a commutative local noetherian ring. We prove that the existence of a chain of semidualizing R-complexes of length (d+1) yields a degree-d polynomial lower bound for the Bass numbers of R. We also show how information about certain…
The concept of balancedly splittable orthogonal designs is introduced along with a recursive construction. As an application, equiangular tight frames over the real, complex, and quaternions meeting the Delsarte-Goethals-Seidel upper bound…
We examine the ranks of operators in semi-finite C*-algebras as measured by their densely defined lower semicontinuous traces. We first prove that a unital simple C*-algebra whose extreme tracial boundary is nonempty and finite contains…
We find necessary and sufficient conditions under which the complex coordinates on a flag manifold of a classical group described in [2] are Bochner coordinates.
We provide bounds on the size of polynomial differential equations obtained by executing closure properties for D-algebraic functions. While it is easy to obtain bounds on the order of these equations, it requires some more work to derive…
A subgroup H of G=(Z/dZ)^* is called balanced if every coset of H is evenly distributed between the lower and upper halves of G, i.e., has equal numbers of elements with representatives in (0,d/2) and (d/2,d). This notion has applications…