English
Related papers

Related papers: Maximal order types for sequences with gap conditi…

200 papers

In the first part, after showing that the most natural approach to define an order on sets of conformal classes fails, we define a nontrivial order $\leq_2$ on the set of conformal classes of compact Cauchy slabs with fixed past boundary…

Differential Geometry · Mathematics 2025-10-22 Olaf Müller

The dynamical system generated by the iterated calculation of the high order gaps between neighboring terms of a sequence of natural numbers is remarkable and only incidentally characterized at the boundary by the notable Proth-Glibreath…

Number Theory · Mathematics 2024-12-11 Raghavendra N. Bhat , Cristian Cobeli , Alexandru Zaharescu

In this paper we study orders over Cohen-Macaulay rings. We discuss desirable properties for these orders if they are to represent NCCRs of the base rings. While some definitions have been made, we discuss an alternate definition and the…

Commutative Algebra · Mathematics 2016-12-07 Josh Stangle

In optimal control, extending the class of admissible controls is a common strategy to guarantee the existence of optimal solutions. However, such extensions may introduce a gap between the infimum of the original problem and the minimum of…

Optimization and Control · Mathematics 2026-03-09 Monica Motta , Michele Palladino , Franco Rampazzo

Given a countable scattered linear order $L$ of Hausdorff rank $\alpha < \omega_1$ we show that it has a $d\text{-}\Sigma_{2\alpha+1}$ Scott sentence. Ash calculated the back and forth relations for all countable well-orders. From this…

Logic · Mathematics 2021-07-01 Rachael Alvir , Dino Rossegger

The Mordell--Lang conjecture for abelian varieties states that the intersection of an algebraic subvariety $X$ with a subgroup of finite rank is contained in a finite union of cosets contained in $X$. In this article, we prove a uniform…

Number Theory · Mathematics 2026-03-27 Ziyang Gao , Tangli Ge , Lars Kühne

The last in-tree recognition problem asks whether a given spanning tree can be derived by connecting each vertex with its rightmost left neighbor of some search ordering. In this study, we demonstrate that the last-in-tree recognition…

Discrete Mathematics · Computer Science 2024-08-26 Jesse Beisegel , Ekkehard Köhler , Fabienne Ratajczak , Robert Scheffler , Martin Strehler

We generalize the existence of maximal orders in a semi-simple algebra for general ground rings. We also improve several statements in Chapter 5 and 6 of Reiner's book concerning separable algebras by removing the separability condition,…

Number Theory · Mathematics 2011-05-17 Chia-Fu Yu

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Logic · Mathematics 2008-03-25 Wesley Calvert , Desmond Cummins , Sara Miller , Julia F. Knight

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…

Logic · Mathematics 2007-05-23 Matthias Aschenbrenner , Wai-Yan Pong

We show that many principles of first-order arithmetic, previously only known to lie strictly between $\Sigma_1$-induction and $\Sigma_2$-induction, are equivalent to the well-foundedness of $\omega^\omega$. Among these principles are the…

Logic · Mathematics 2015-12-15 Alexander P. Kreuzer , Keita Yokoyama

We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms. Varieties of…

Logic in Computer Science · Computer Science 2023-06-22 Zoltan Esik , Dexter Kozen

Let $X$ be an uncountable Polish space and let $\mathcal{H}$ be the Hindman ideal, that is, the family of all $S\subseteq \omega$ which are not $IP$-sets. For each sequence $x=(x_n)_{n \in \omega}$ taking values in $X$, let…

General Topology · Mathematics 2026-01-21 Rafał Filipów , Adam Kwela , Paolo Leonetti

The purposes of this note are the following two; we first generalize Okada-Takeuti's well quasi ordinal diagram theory, utilizing the recent result of Dershowitz-Tzameret's version of tree embedding theorem with gap conditions. Second, we…

Logic in Computer Science · Computer Science 2019-02-07 Mitsuhiro Okada , Yuta Takahashi

Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <=…

Number Theory · Mathematics 2010-09-01 N. A. Carella

For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…

Logic in Computer Science · Computer Science 2026-02-24 A. R. Balasubramanian , Vitor Greati , Revantha Ramanayake

For a cardinal of the form $\kappa=\beth_\kappa$, Shelah's logic $L^1_\kappa$ has a characterisation as the maximal logic above $\bigcup_{\lambda<\kappa} L_{\lambda, \omega}$ satisfying Strong Undefinability of Well Order (SUDWO). SUDWO is…

Logic · Mathematics 2021-07-22 Mirna Džamonja , Jouko Väänänen

Following Laczkovich we consider the partially ordered set $\iB_1(\RR)$ of Baire class 1 functions endowed with the pointwise order, and investigate the order types of the linearly ordered subsets. Answering a question of Komj\'ath and…

Logic · Mathematics 2011-09-29 Márton Elekes , Juris Steprāns

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

Combinatorics · Mathematics 2026-02-24 Simone Costa , Stefano Della Fiore

For x and y sequences of real numbers define the inner product (x,y) = x(0)y(0) + x(1)y(1)+ ... which may not be finite or even exist. We say that x and y are orthogonal iff (x,y) converges and equals 0. Define l_p to be the set of all real…

Logic · Mathematics 2016-09-06 Arnold W. Miller , Juris Steprāns