Related papers: Topological lower bounds for arithmetic networks
In this paper we propose a general method for computing a minimal free right resolution of a finitely presented graded right module over a finitely presented graded noncommutative algebra. In particular, if such module is the base field of…
In a paper by Lin an interesting family of semipermutations comes out to index the elements of a cohomology basis of a Hessenberg type variety. The corresponding Betti numbers are a generalization of Eulerian numbers. We show three…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
Modeling distributed computing in a way enabling the use of formal methods is a challenge that has been approached from different angles, among which two techniques emerged at the turn of the century: protocol complexes, and directed…
If $M$ is the complement of a hyperplane arrangement, and $A=H^*(M,\k)$ is the cohomology ring of $M$ over a field of characteristic 0, then the ranks, $\phi_k$, of the lower central series quotients of $\pi_1(M)$ can be computed from the…
We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…
We give a bound for the Betti numbers of the Stanley-Reisner ring of a stellar subdivision of a Gorenstein* simplicial complex by applying unprojection theory. From this we derive a bound for the Betti numbers of iterated stellar…
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…
We consider arrangements of n connected codimensional one submanifolds in closed d-dimensional manifold M. Let f be the number of connected components of the complement in M to the union of submanifolds. We prove the sharp lower bound for f…
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…
Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…
Persistent homology is a fundamental tool in topological data analysis; however, it lacks methods to quantify the fragility or fineness of cycles, anticipate their formation or disappearance, or evaluate their stability beyond persistence.…
We prove a bound conjectured by Itenberg on the Betti numbers of real algebraic hypersurfaces near non-singular tropical limits. These bounds are given in terms of the Hodge numbers of the complexification. To prove the conjecture we…
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…
We prove a new bound for the number of connected components of a real regular elliptic surface with a real section and we show the sharpness of this bound. Furthermore, all possible values for the Betti numbers of such a surface are…
This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the…
We introduce fibrewise Whitehead- and fibrewise Ganea definitions of monoidal topological complexity. We then define several lower bounds for the topological complexity, which improve on the standard lower bound in terms of nilpotency of…
The learnability of different neural architectures can be characterized directly by computable measures of data complexity. In this paper, we reframe the problem of architecture selection as understanding how data determines the most…
In this paper we study some algebraic properties of hypergraphs, in particula their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge, are not previously considered in the literature.…
We give explicit formulas for the asymptotic Betti numbers of the unordered configuration spaces of an arbitrary finite graph over an arbitrary field.