Related papers: Combinatorial complexity in o-minimal geometry
We prove structure theorems for o-minimal definable subsets $S\subset G$ of definable groups containing large multiplicative structures, and show definable groups do not have bounded torsion arbitrarily close to the identity. As an…
Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
Consider the vanishing locus of a real analytic function on $\mathbb{R}^n$ restricted to $[0,1]^n$. We bound the number of rational points of bounded height that approximate this set very well. Our result is formulated and proved in the…
We introduce and discuss a definition of approximation of a topological algebraic system $A$ by finite algebraic systems of some class $\K$. For the case of a discrete algebraic system this definition is equivalent to the well-known…
We identify a canonical structure J associated to any first-order theory, the {\it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
We construct orbifolds with quasitoric boundary and show that they have stable almost complex structure. We show that a quasitoric orbifold is complex cobordant to finite disjoint copies of complex orbifold projective spaces. Finally some…
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
In this note we show that every definably connected, definably compact abelian definable group in an o-minimal expansion of a real closed field of dimension not 4 is definably homeomorphic to a torus of the same dimension. Moreover, in the…
We introduce the Hausdorff measure for definable sets in an o-minimal structure, and prove the Cauchy-Crofton and co-area formulae for the o-minimal Hausdorff measure. We also prove that every definable set can be partitioned into "basic…
We calculate the higher topological complexity TC$_s$ for the complements of reflection arrangements, in other words for the pure Artin type groups of all finite complex reflection groups. In order to do that we introduce a simple…
O-minimal geometry generalizes both semialgebraic and subanalytic geometries, and has been very successful in solving special cases of some problems in arithmetic geometry, such as Andr\'e-Oort conjecture. Among the many tools developed in…
Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement. Among all…
A series of recent papers by Bergfalk, Lupini and Panagiotopoulus developed the foundations of a field known as `definable algebraic topology,' in which classical cohomological invariants are enriched by viewing them as groups with a Polish…
There is a long history of studying Ramsey theory using the algebraic structure of Stone-Cech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic large…