Related papers: Exponentiable linear orders need not be transitive

In this paper, via h-principle we prove that there exist contractible positive loops of Legendrian embeddings based at any loose Legendrian submanifold. As an application, we define a new partial order on $\widetilde{Cont}_0(M,\xi)$ and…

In this contribution, the transitivity property of commutative first-order linear time-varying systems is investigated with and without initial conditions. It is proven that transitivity property of first-order systems holds with and…

A well-known conjecture of Orlov asks whether the existence of a full exceptional collection implies rationality of the underlying variety. We prove this conjecture for arithmetic toric varieties over general fields. We also investigate a…

We show that the mapping class group of an orientable finite type surface has uniformly exponential growth, as well as various closely related groups. This provides further evidence that mapping class groups may be linear.

We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…

For a finite tensor category $\mathcal C$ and a Hopf monad $T:\mathcal C\to \mathcal C$ satisfying certain conditions we describe exact indecomposable left $\mathcal C^T$-module categories in terms of left $\mathcal C$-module categories and…

In this note we prove a Birkhoff type transitivity theorem for continuous maps acting on non-separable completely metrizable spaces and we give some applications for dynamics of bounded linear operators acting on complex Fr\'{e}chet spaces.…

It is well known that MTL with integer endpoints is unable to express all of monadic first-order logic of order and metric (FO(<,+1)). Indeed, MTL is unable to express the counting modalities $C_n$ that assert a properties holds $n$ times…

Assume $\mathcal{C}$ is the class of all linear orders $L$ such that $L$ is not a countable union of well ordered sets, and every uncountable subset of $L$ contains a copy of $\omega_1$. We show it is consistent that $\mathcal{C}$ has…

Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is…

We say that a theory $T$ is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective reducibility. We prove that if an infinitary sentence $T$ is…

Drawing inspiration from a recent paper of Heuberger, Krenn, and Lipnik, we define the class of strongly k-recursive sequences. We show that every k-automatic sequence is strongly $k$-recursive, therefore k-recursive, and discuss that the…

A $2t$-cycle system of order $v$ is a set $\mathcal{C}$ of cycles whose edges partition the edge-set of $K_v-I$ (i.e., the complete graph minus the $1$-factor $I$). If $v\equiv 0 \pmod{2t}$, a set of $v/2t$ vertex-disjoint cycles of…

We make available some results about model theory cyclically ordered groups. We start with a classification of complete theories of divisible abelian cyclically ordered groups. Then we look at the cyclically ordered groups where the only…

A cyclic proof system allows us to perform inductive reasoning without explicit inductions. We propose a cyclic proof system for HFLN, which is a higher-order predicate logic with natural numbers and alternating fixed-points. Ours is the…

In 1950, B.A. Trakhtenbrot showed that the set of first-order tautologies associated to finite models is not recursively enumerable. In 1999, P. H\'ajek generalized this result to the first-order versions of \L ukasiewicz, G\"odel and…

It is well known that \omega-limit sets are internally chain transitive and have weak incompressibility; the converse is not generally true, in either case. However, it has been shown that a set is weakly incompressible if and only if it is…

The starting place is a brief proof of a well-known result, the hyponormality of $C_k$ (the generalized Ces\`{a}ro operator of order one) for $k \geq 1$. This leads to the definition of a superclass of the posinormal operators. It is shown…

We classify line nodes in superconductors with strong spin-orbit interactions and time-reversal symmetry, where the latter may include non-primitive translations in the magnetic Brillouin zone to account for coexistence with…

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…