English
Related papers

Related papers: Epimorphisms between linear orders

200 papers

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.

Rings and Algebras · Mathematics 2013-10-01 G. Grätzer

We propose a log-concavity conjecture for BPS invariants arising in the enumerative geometry of planar curve singularities, identified with the local Euler obstructions of Severi strata in their versal deformations. We further extend this…

Algebraic Geometry · Mathematics 2026-05-01 Tao Su , Baiting Xie , Chenglong Yu

We consider the space of countable structures with fixed underlying set in a given countable language. We show that the number of ergodic probability measures on this space that are $S_\infty$-invariant and concentrated on a single…

We study invariants under gauge transformations of linear partial differential operators on two variables. Using results of BK-factorization, we construct hierarchy of general invariants for operators of an arbitrary order. Properties of…

Exactly Solvable and Integrable Systems · Physics 2015-06-26 E. Kartashova

A basic problem in the theory of partially ordered vector spaces is to characterise those cones on which every order-isomorphism is linear. We show that this is the case for every Archimedean cone that equals the inf-sup hull of the sum of…

Functional Analysis · Mathematics 2023-11-27 Bas Lemmens , Hent van Imhoff , Onno van Gaans

We explore countable ordered Archimedean groups from the point of view of descriptive set theory. We introduce the space of Archimedean left-orderings $\mathrm{Ar}(G)$ for a given countable group $G$, and prove that the equivalence relation…

Logic · Mathematics 2023-01-16 Filippo Calderoni , David Marker , Luca Motto Ros , Assaf Shani

We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…

Logic · Mathematics 2007-05-23 Mor Doron , Saharon Shelah

A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…

Combinatorics · Mathematics 2012-01-31 Graham Brightwell , Malwina Luczak

In this paper, we study the irreducible representations of skew braces of order \( pq \), which is equivalent to studying the representation theory of groups of order \( p^2q^2 \) arising from skew left braces, where \( p > q \) are primes.…

Group Theory · Mathematics 2025-03-07 Nishant Rathee , Ayush Udeep

We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the…

Logic in Computer Science · Computer Science 2015-07-01 Kord Eickmeyer , Martin Grohe

The concept of sequential choice functions is introduced and studied. This concept applies to the reduction of the problem of stable matchings with sequential workers to a situation where the workers are linear.

Combinatorics · Mathematics 2024-03-26 Vladimir I. Danilov

The problem of equivalency for linear differential operators of the first order is discussed.

Differential Geometry · Mathematics 2020-03-31 Valentin Lychagin

We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three…

Logic in Computer Science · Computer Science 2018-05-30 Olivier Carton , Thomas Colcombet , Gabriele Puppis

In this paper, we mainly investigate profound interconnections between combinatorial designs, linear codes, and Boolean functions.

Information Theory · Computer Science 2026-05-26 Jong Yoon Hyun , Jieun Kwon , Jiaxin Wang , Yansheng Wu

An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…

Mathematical Physics · Physics 2009-04-13 C. Bizdadea , E. M. Cioroianu , I. Negru , S. O. Saliu , S. C. Sararu , O. Balus

By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory…

Combinatorics · Mathematics 2012-03-01 Yohji Akama

This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…

Logic in Computer Science · Computer Science 2015-08-12 Mario Coppo , Mariangiola Dezani-Ciancaglini , Ines Margaria , Maddalena Zacchi

Order positions are key variables in algorithmic trading. This paper studies the limiting behavior of order positions and related queues in a limit order book. In addition to the fluid and diffusion limits for the processes, fluctuations of…

Trading and Market Microstructure · Quantitative Finance 2015-10-14 Xin Guo , Zhao Ruan , Lingjiong Zhu

We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…