Related papers: On topological lower bounds for algebraic computat…
We consider the multiparameter random simplicial complex on a vertex set $\{ 1,\dots,n \}$, which is parameterized by multiple connectivity probabilities. Our key results concern the topology of this complex of dimensions higher than the…
Belyi's Theorem states that a Riemann surface, X, as an algebraic curve is defined over an algebraic closure of the rationals if and only if there exists a holomorphic function taking X to the Riemann sphere with at most three critical…
Given a polynomial map $\psi:S^m\to \mathbb{R}^k$ with components of degree $d$, we investigate the structure of the semialgebraic set $Z\subseteq S^m$ consisting of those points where $\psi$ and its derivatives satisfy a given list of…
A tight lower bound for required I/O when computing an ordinary matrix-matrix multiplication on a processor with two layers of memory is established. Prior work obtained weaker lower bounds by reasoning about the number of segments needed…
In their paper on multiplicity bounds (1998), Herzog and Srinivasan study the relationship between the graded Betti numbers of a homogeneous ideal I in a polynomial ring R and the degree of I. For certain classes of ideals, they prove a…
The starting point is the class of the following simplicial complexes $\Delta$ with 2-linear resolutions. The facets of $\Delta$ are $F_1,\ldots,F_n$, and we demand that for each $i$ $F_i\cap (F_1\cup \cdots\cup F_{i-1}\cup…
Motivated by a recent result of Elberfeld, Jakoby and Tantau showing that $\mathsf{MSO}$ properties are Logspace computable on graphs of bounded tree-width, we consider the complexity of computing the determinant of the adjacency matrix of…
We prove that cocompact arithmetic lattices in a simple Lie group are uniformly discrete if and only if the Salem numbers are uniformly bounded away from $1$. We also prove an analogous result for semisimple Lie groups. Finally, we shed…
The goal of this paper is to ameliorate the sufficients conditions, already established by the first author so that the sum of the numbers of Betti, of 1-connected rational finite CW-complex, is higher than the dimension of his $\mathbb…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The goal of this paper is to obtain lower bounds on the height of an algebraic number in a relative setting, extending previous work of Amoroso and Masser. Specifically, in our first theorem we obtain an effective bound for the height of an…
We prove a tight lower bound on the Betti numbers of tree and forest ideals and a tight upper bound on certain graded Betti numbers of squarefree monomial ideals.
We define decision trees for monotone functions on a simplicial complex. We define homology decidability of monotone functions, and show that various monotone functions related to semimatroids are homology decidable. Homology decidability…
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 study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show…
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 these lectures we cover basics of the theory of heights starting with the heights in the projective space, heights of polynomials, and heights of the algebraic curves. We define the minimal height of binary forms and moduli height for…
Let $\mathbf{a} = a_1 <\dots < a_r$ be a sequence of positive integers, and let $H_{\mathbf{a}}$ denote the semigroup generated by $a_1, \dots, a_r$. For an integer $k\geq 0$ we denote by $\mathbf{a}+k$ the shifted sequence $a_1 +k, \dots,…
Let $P$ be a set of $m$ points in ${\mathbb R}^2$, let $\Sigma$ be a set of $n$ semi-algebraic sets of constant complexity in ${\mathbb R}^2$, let $(S,+)$ be a semigroup, and let $w: P \rightarrow S$ be a weight function on the points of…