Related papers: General non-structure theory and constructing from…
Establishing reliable and interpretable structure-property relationships in glasses is a longstanding challenge in condensed matter physics. While modern data-driven machine learning techniques have proven highly effective in establishing…
The embedding problem is to decide, given an ordered pair of structures, whether or not there is an injective homomorphism from the first structure to the second. We study this problem using an established perspective in parameterized…
We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…
Graphs are extremely versatile and ubiquitous mathematical structures with potential to model a wide range of domains. For this reason, graph problems have been of interest since the early days of computer science. Some of these problems…
With the advent of computers, one needs algebraic structures that can simultaneously work with bulk data. One such algebraic structure, namely, n-linear algebras of type I are introduced in this book and its applications to n-Markov chains…
We propose a generalization of non-commutative geometry and gauge theories based on ternary Z_3-graded structures. In the new algebraic structures we define, we leave all products of two entities free, imposing relations on ternary products…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
Taking inspiration from [1, 21, 24], we develop a general framework to deal with the model theory of open incidence structures. In this first paper we focus on the study of systems of points and lines (rank $2$). This has a number of…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
In this paper the algebraic structure of the isotropic nth-order gradient elasticity is investigated. In the classical isotropic elasticity it is well-known that the constitutive relation can be broken down into two uncoupled relations…
We give a rigorous formulation of the intuitive idea that a differentiable map should be thesame thing as a locally, or infinitesimally, linear map: just as a linear map respects the operations of addition and multiplication by scalars ina…
The first steps towards linearisation of partial orders and equivalence relations are described. The definitions of partial orders and equivalence relations (on sets) are formulated in a way that is standard in category theory and that…
We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce 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…
We study the problem of learning properties of nodes in tree structures. Those properties are specified by logical formulas, such as formulas from first-order or monadic second-order logic. We think of the tree as a database encoding a…
Assuming an instance of the Brodsky-Rinot proxy principle holding at a regular uncountable cardinal $\kappa$, we construct $2^\kappa$-many pairwise non-embeddable minimal non-$\sigma$-scattered linear orders of size $\kappa$. In particular,…
For any limit ordinal $\lambda$, we construct a linear order $L_\lambda$ whose Scott complexity is $\Sigma_{\lambda+1}$. This completes the classification of the possible Scott sentence complexities of linear orderings. Previously, there…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
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…