Related papers: Patchworking real algebraic hypersurfaces with asy…
Using basic properties of perverse sheaves, we give new upper bounds for compactly supported Betti numbers for arbitrary affine varieties in $\mathbb{A}^n$ defined by $r$ polynomial equations of degrees at most $d$. As arithmetic…
We give examples of closed hyperbolic 3-manifolds with first Betti number 2 and 3 for which no sequence of finite abelian covering spaces increases the first Betti number. For 3-manifolds $M$ with first Betti number 2 we give a…
We construct a family of examples of complete $(2+n)-$dimensional ($n\ge 2$) open manifolds with positive Ricci curvature, sectional curvature bounded from below and infinite Betti numbers $b_2,b_n$, moreover its volume growth can be…
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 study Betti structures in the solution complexes of confluent hypergeometric equations. We use the framework of enhanced ind-sheaves and the irregular Riemann-Hilbert correspondence of D'Agnolo-Kashiwara. The main result is a group…
A group of isometries of a hyperbolic $n$-space is called a reflection group if it is generated by reflections in hyperbolic hyperplanes. Vinberg gave a semi-algorithm for finding a maximal reflection sublattice in a given arithmetic…
In applications like computer aided design, geometric models are often represented numerically as polynomial splines or NURBS, even when they originate from primitive geometry. For purposes such as redesign and isogeometric analysis, it is…
In this PhD thesis, we give a new geometric approach to higher Teichm\"uller theory. In particular we construct a geometric structure on surfaces, generalizing the complex structure, and we explore its link to Hitchin components. The…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
Betti numbers of configuration spaces of mechanical linkages (known also as polygon spaces) depend on a large number of parameters -- the lengths of the bars of the linkage. Motivated by applications in topological robotics, statistical…
Symmetry in integer programming causes redundant search and is often handled with symmetry breaking constraints that remove as many equivalent solutions as possible. We propose an algebraic method which allows to generate a random family of…
Connected components of real algebraic varieties invariant under the $CB_{n}$-Coxeter group are investigated. In particular, we consider their maximal number and their geometric and topological properties. This provides a decomposition for…
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…
We develop a version of Mikhalkin's lattice path algorithm for projective hypersurfaces of arbitrary degree and dimension, which enumerates singular tropical hypersurfaces passing through appropriate configuration of points. By proving a…
Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…
We consider the topology of simplicial complexes with vertices the points of a random point process and faces determined by distance relationships between the vertices. In particular, we study the Betti numbers of these complexes as the…
We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner…
We first show that the union of a projective curve with one of its extremal secant lines satisfies the linear general position principle for hyperplane sections. We use this to give an improved approximation of the Betti numbers of curves…
Numerical algebraic geometry provides a number of efficient tools for approximating the solutions of polynomial systems. One such tool is the parameter homotopy, which can be an extremely efficient method to solve numerous polynomial…
We present a systematic framework for constructing exactly-solvable lattice models of symmetry-enriched topological (SET) phases based on an enlarged version of the string-net model. We also gauge the global symmetries of our SET models to…