Related papers: On topological lower bounds for algebraic computat…
Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…
In this paper, we prove the degree upper bound of projective subschemes in terms of the reduction number and show that the maximal cases are only arithmetically Cohen-Macaulay subschemes with linear resolution. Furthermore, it can be shown…
In the present paper, we consider upper bounds of higher linear syzygies i.e. graded Betti numbers in the first linear strand of the minimal free resolutions of projective varieties in arbitrary characteristic. For this purpose, we first…
Addressing a question of Gowers, we determine the order of the tower height for the partition size in a version of Szemer\'edi's regularity lemma.
We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a…
We give lower bounds on the number of effective divisors of degree $\leq g-1$ with respect to the number of places of certain degrees of an algebraic function field of genus $g$ defined over a finite field. We deduce lower bounds and…
Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.
Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraic statistics. We study the minimal free resolutions of cut ideals of tree graphs. By employing basic methods from topological combinatorics, we obtain…
The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…
The Betti tables of a multigraded module encode the grades at which there is an algebraic change in the module. Multigraded modules show up in many areas of pure and applied mathematics, and in particular in topological data analysis, where…
Suppose the ground field $\mathbb{F}$ is an algebraically closed field of characteristic different from 2, 3. We determine the Betti numbers and make a decomposition of the associative superalgebra of the cohomology for the model filiform…
We derive a uniform bound for the total betti number of a closed manifold in terms of a Ricci curvature lower bound, a conjugate radius lower bound and a diameter upper bound. The result is based on an angle version of Toponogov comparison…
Important subalgebras of a Lie algebra of an algebraic group are its toral subalgebras, or equivalently (over fields of characteristic 0) its Cartan subalgebras. Of great importance among these are ones that are split: their action on the…
We consider the randomized decision tree complexity of the recursive 3-majority function. We prove a lower bound of $(1/2-\delta) \cdot 2.57143^h$ for the two-sided-error randomized decision tree complexity of evaluating height $h$ formulae…
In this paper we improve the lower bound of Chatterjee et al.\ (ECCC 2019) to an $\Omega(n^2)$ lower bound for unlayered Algebraic Branching Programs. We also study the impact layerization has on Algebraic Branching Programs. We exhibit a…
We prove general topological Radon-type theorems for sets in $\mathbb R^d$ or on a surface. Combined with a recent result of Holmsen and Lee, we also obtain fractional Helly theorem, and consequently the existence of weak $\varepsilon$-nets…
Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…
Let $\mathrm{R}$ be a real closed field. We prove that the number of semi-algebraically connected components of a real hypersurface in $\mathrm{R}^n$ defined by a multi-affine polynomial of degree $d$ is bounded by $2^{d-1}$. This bound is…
We prove graded bounds on the individual Betti numbers of affine and projective complex varieties. In particular, we give for each $p,d,r$, explicit bounds on the $p$-th Betti numbers of affine and projective subvarieties of $\mathrm{C}^k$,…