Related papers: Weakly binary expansions of dense meet-trees

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

We study the monoid of global invariant types modulo domination-equivalence in the context of o-minimal theories. We reduce its computation to the problem of proving that it is generated by classes of 1-types. We show this to hold in Real…

We construct a `weak' version EM^w(K) of Lack & Street's 2-category of monads in a 2-category K, by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between…

Weakly Schreier split extensions are a reasonably large, yet well-understood class of monoid extensions, which generalise some aspects of split extensions of groups. This short note provides a way to define and study similar classes of…

In this note we study the weak topology on paired modules over a (not necessarily commutative) ground ring. Over QF rings we are able to recover most of the well known properties of this topology in the case of commutative base fields. The…

This is the first of a series of articles providing a foundation for the theory of Drinfeld modular forms of arbitrary rank r. In the present part, we develop the analytic theory. Most of the work goes into defining and studying the…

We consider extremal problems related to decks and multidecks of rooted binary trees (a.k.a. rooted phylogenetic tree shapes). Here, the deck (resp. multideck) of a tree $T$ refers to the set (resp. multiset) of leaf induced binary subtrees…

In this article we extend the theory of lax monoidal structures, also known as multitensors, and the monads on categories of enriched graphs that they give rise to. Our first principal result -- the lifting theorem for multitensors --…

Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.

Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminism in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the…

Tree-ordered weakly sparse models have recently emerged as a robust framework for representing structures in an ``almost sparse'' way, while allowing the structure to be reconstructed through a simple first-order interpretation. A prominent…

The article addresses some open questions about the relations between the topological weak mixing property and the transitivity of the map $f\times f^2 \times...\times f^m$, where $f\colon X\ra X$ is a topological dynamical system on a…

We investigate one dimensional tight binding model in the presence of a correlated binary disorder. The disorder is due to the interaction of particles with heavy immobile other species. Off-diagonal disorder is created by means of a fast…

Every absolutely summing linear operator is weakly compact. However, for strongly summing multilinear operators and polynomials - one of the most natural extensions of the linear case to the non linear framework - weak compactness does not…

We analyze definably compact groups in o-minimal expansions of ordered groups as a combination of semi-linear groups and groups definable in o-minimal expansions of real closed fields. The analysis involves structure theorems about their…

A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For…

Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…

We apply set-theoretic methods to study projective modules and their generalizations over transfinite extensions of simple artinian rings R. When R is hereditary and of cardinality at most $2^\omega$, we prove that the Weak Diamond and CH…

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…