Related papers: Topological lower bounds for arithmetic networks

We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks. These techniques become useful when the size of the network (or clique size) precludes exact computations.…

We study certain random simplicial complexes, called random quota complexes. A quota complex on $N+1$ weighted vertices is constructed by adding an $n$-simplex if the sum of the weights of the vertices is below a given quota, $q$. In this…

We use buildings and group extensions to compute lower bounds on the top Betti numbers for the cohomology of the level p congruence subgroups of SL(3,Z) and Sp(4,Z).

We establish general bounds on the topology of free boundary minimal surfaces obtained via min-max methods in compact, three-dimensional ambient manifolds with mean convex boundary. We prove that the first Betti number is lower…

We propose a refinement of the Betti numbers and of the homology with coefficients in a field of a compact ANR in the presence of a continuous real valued function. The refinement of Betti numbers consists of finite configurations of points…

We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise).…

We show that the topological complexity of an aspherical space $X$ is bounded below by the cohomological dimension of the direct product $A\times B$, whenever $A$ and $B$ are subgroups of $\pi_1(X)$ whose conjugates intersect trivially. For…

Explicit formulas determining the dimension and the degree of the singular subscheme of hypersurfaces in ${\mathbb P}^n$ are given in terms of the graded Betti numbers of the minimal free resolution of the corresponding Jacobian algebra.…

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

The algebraic connectivity of a network characterizes the lower-bound of the exponential convergence rate of consensus processes. This paper investigates the problem of accelerating the convergence of consensus processes by adding links to…

We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…

We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.

Given a point $\xi$ on a complex abelian variety $A$, its abelian logarithm can be expressed as a linear combination of the periods of $A$ with real coefficients, the Betti coordinates of $\xi$. When $(A, \xi)$ varies in an algebraic…

We provide upper bounds for logarithmic torsion homology growth and Betti number growth of groups, phrased in the language of measured group theory.

We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…

Let $M$ be a finitely generated module over a local ring $(R,\mathfrak{m})$. By $\mathcal{S}_j(M)$, we denote the $j$th symmetric power of $M$ ($j$th graded component of the symmetric algebra $\mathcal{S}_R(M)$). The purpose of this paper…

Let $T$ be a perfect binary tree and $I$ be its edge ideal in the polynomial ring $S$. We determine the vertex cover number, independent number, and establish the recursive formula to compute the number of minimal vertex covers. As a…

We present a method for deciding when a regular abelian cover of a finite CW-complex has finite Betti numbers. To start with, we describe a natural parameter space for all regular covers of a finite CW-complex X, with group of deck…

We prove three new lower bounds for graph connectivity in the $1$-bit broadcast congested clique model, BCC$(1)$. First, in the KT-$0$ version of BCC$(1)$, in which nodes are aware of neighbors only through port numbers, we show an…

Looking for an efficient algorithm for the computation of the homology groups of an algebraic set or even a semi-algebraic set is an important problem in the effective real algebraic geometry. Recently, Peter Burgisser, Felipe Cucker and…