Related papers: An ordered structure of rank two related to Dulac'…

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Our start point is a 3D piecewise smooth vector field defined in two zones and presenting a shared fold curve for the two smooth vector fields considered. Moreover, these smooth vector fields are symmetric relative to the fold curve, giving…

We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal…

In the first part of this paper we investigate the operator aspect of higher-rank supersymmetric model which is introduced as a Lie theoretic extension of the $N=2$ minimal model with the simplest case $su(2)$ corresponding to the $N=2$…

For a topological flow $(V,\phi)$ - i.e., $V$ is a linearly compact vector space and $\phi$ a continuous endomorphism of $V$ - we gain a deep understanding of the relationship between $(V,\phi)$ and the Bernoulli shift: a topological flow…

We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

We introduce the notion of the definable rank of an ordered field, ordered abelian group and ordered set, respectively. We study the relation between the definable rank of an ordered field and the definable rank of the value group of its…

This paper shows a mathematical formalization, algorithms and computation software of volume optimal cycles, which are useful to understand geometric features shown in a persistence diagram. Volume optimal cycles give us concrete and…

In 1917, Huntington and Kline, followed by Huntington in 1924, studied systems of axioms for ternary relations aiming to capture the concepts of linear order (called betwenness) and cycle order, respectively. Among many other properties,…

Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…

First-order model counting (FOMC) is the problem of counting the number of models of a sentence in first-order logic. Since lifted inference techniques rely on reductions to variants of FOMC, the design of scalable methods for FOMC has…

Recently, a tensor factorization based method for a low tubal rank tensor completion problem of a third order tensor was proposed, which performed better than some existing methods. Tubal rank is only defined on one mode of third order…

The paper deals with planar polynomial vector fields. We aim to estimate the number of orbital topological equivalence classes for the fields of degree n. An evident obstacle for this is the second part of Hilbert's 16th problem. To…

We consider the class of languages defined in the 2-variable fragment of the first-order logic of the linear order. Many interesting characterizations of this class are known, as well as the fact that restricting the number of quantifier…

I discuss some recent work linking certain aspects of the second part of Hilbert's 16th problem to the theory of \hbox{o-minimality}. These notes are adapted from a lecture I gave in the Jour fixe seminar series at the Zukunfts\-kolleg of…

This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…

Let $\mathfrak{P}$ be a topological property. We study the relation between the order structure of the set of all $\mathfrak{P}$-extensions of a completely regular space $X$ with compact remainder (partially ordered by the standard partial…