Related papers: Multidimensional tilings and MSO logic
The symmetry group structures of two dimensional coupled nonlinear Shr\"{o}dinger equations are considered. We first show that the equations admit infinite dimensional symmetry algebra as well as the corresponding symmetry group depending…
We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke…
We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…
By introducing a new invariant called the set of slidings, we give a complete strict classification of the class of germs of non-dicritical holomorphic foliations in the plan whose Camacho-Sad indices are not rational. Moreover, we will…
In this paper and in the forthcoming Part II we introduce a Morse complex for a class of functions f defined on an infinite dimensional Hilbert manifold M, possibly having critical points of infinite Morse index and coindex. The idea is to…
Multivariate decision trees are powerful machine learning tools for classification and regression that attract many researchers and industry professionals. An optimal binary tree has two types of vertices, (i) branching vertices which have…
We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…
This paper is about an extension of monadic second-order logic over the full binary tree, which has a quantifier saying ``almost surely a branch {\pi} \in {0, 1}^w satisfies a formula {\phi}({\pi})''. This logic was introduced by…
We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…
Several queries and scores have recently been proposed to explain individual predictions over ML models. Given the need for flexible, reliable, and easy-to-apply interpretability methods for ML models, we foresee the need for developing…
In the last years, enumeration algorithms with bounded delay have attracted a lot of attention for several data management tasks. Given a query and the data, the task is to preprocess the data and then enumerate all the answers to the query…
We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…
The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…
We compute the transgressed forms of some modularly invariant characteristic forms,which are related to the twisted elliptic genera. We study the modularity properties of these secondary characteristic forms and relations among them. We…
We consider the structure of Pisot substitution tiling spaces, in particular, the structure of those spaces for which the translation action does not have pure discrete spectrum. Such a space is always a measurable m-to-one cover of an…
In this article we study Cohen-Macaulay modules over one-dimensional hypersurface singularities and the relationship with the representation theory of associative algebras using methods of cluster tilting theory. We give a criterion for…
Our main result is a succinct counterpoint to Courcelle's meta-theorem as follows: every cw-nontrivial monadic second-order (MSO) property is either NP-hard or coNP-hard over graphs given by succinct representations. Succint representations…
Multiplicative invariance is a well-studied property of subsets of the unit interval. The theory in the complex plane is less developed. This paper introduces an analogous definition for multiplicative invariance in the complex plane…
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…