Related papers: Descriptive Complexity of Finite Structures: Savin…
We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimension is beyond a computable bound, the Markov bases consist…
We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…
A common theme in factorised databases and knowledge compilation is the representation of solution sets in a useful yet succinct data structure. In this paper, we study the representation of the result of join queries (or, equivalently, the…
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…
Most adaptive finite element strategies employ the D\"orfler marking strategy to single out certain elements $\mathcal{M} \subseteq \mathcal{T}$ of a triangulation $\mathcal{T}$ for refinement. In the literature, different algorithms have…
We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thi\'ery and the second author. A…
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…
The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded…
We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that is defined by a formula with quantifier prefix…
(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…
Decompositions on manifolds appear in various geometric structures. Necessary and sufficient conditions for quotient spaces of decompositions to be manifolds are widely characterized. We characterize necessary and sufficient conditions to…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
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…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
Let $\mathcal{F}\subset\binom{[n]}{k}$ be an intersecting family. For an element $i\in[n]$, the degree of $i$ is the number of sets in $\mathcal{F}$ that contain $i$. Assume that the degrees are ordered as $d_{1}\ge d_{2}\ge\cdots\ge…
Let $M$ be a closed hypersurface in a noncompact rank-1 symmetric space $(\bar{\mathbb{M}}, ds^2)$ with $-4 \leq K_{\bar{\mathbb{M}}} \leq -1,$ or in a complete, simply connected Riemannian manifold $\mathbb{M}$ such that $0 \leq…
The {\it profile} of a relational structure $R$ is the function $\phi_R$ which counts for every integer $n$ the number of its $n$-element substructures up to an isomorphism. Many counting functions are profiles. Interesting examples come…
We give a construction of a large first-order definable family of subrings of finitely generated fields $K$ of any characteristic. We deduce that for any such $K$ there exists a first-order sentence $\varphi_K$ characterising $K$ in the…
We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…