English
Related papers

Related papers: Infinite decreasing chains in the Mitchell order

200 papers

We define a class of discrete abelian group extensions of rank-one transformations and establish necessary and sufficient conditions for these extensions to be power weakly mixing. We show that all members of this class are multiply…

Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for…

Formal Languages and Automata Theory · Computer Science 2015-02-17 Vincent Penelle

A sequence of Markov chains is said to exhibit (total variation) cutoff if the convergence to stationarity in total variation distance is abrupt. We consider reversible lazy chains. We prove a necessary and sufficient condition for the…

Probability · Mathematics 2018-01-19 Riddhipratim Basu , Jonathan Hermon , Yuval Peres

We define a notion of rank for words and subshifts that we call spacer rank, extending the notion of rank-one symbolic shifts of Gao and Hill. We construct infinite words of each finite spacer rank, of unbounded spacer rank, and show there…

Dynamical Systems · Mathematics 2024-06-27 Su Gao , Liza Jacoby , William Johnson , James Leng , Ruiwen Li , Cesar E. Silva , Yuxin Wu

We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…

Group Theory · Mathematics 2025-03-03 João V. P. e Silva

We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that class of acyclic graphs has the Ramsey property and uses the partite construction.

Combinatorics · Mathematics 2017-03-03 Jaroslav Nešetřil , Vojtěch Rödl

Given an elliptic curve $E/\mathbb{Q}$, it is a conjecture of Goldfeld that asymptotically half of its quadratic twists will have rank zero and half will have rank one. Nevertheless, higher rank twists do occur: subject to the parity…

Number Theory · Mathematics 2018-10-10 Robert J. Lemke Oliver , Frank Thorne

The main contribution of this note is to establish a framework to extend results of tensor functions over specific field to general field. As a consequence of this framework, we extend the existing work to more general settings: \emph{(1)}…

Commutative Algebra · Mathematics 2026-03-11 Qiyuan Chen

We study the recurrence/transience phase transition for Markov chains on $\mathbb{R}_+$, $\mathbb{R}$, and $\mathbb{R}^2$ whose increments have heavy tails with exponent in $(1,2)$ and asymptotically zero mean. This is the infinite-variance…

Probability · Mathematics 2019-06-24 Nicholas Georgiou , Mikhail V. Menshikov , Dimitri Petritis , Andrew R. Wade

We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…

Logic · Mathematics 2021-06-24 Pantelis E. Eleftheriou , Alex Savatovsky

In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…

Group Theory · Mathematics 2026-02-18 Weijia Wang , Rui Wang

We investigate structural properties of non-sofic groups, assuming that such groups exist. We introduce and study two classes: minimal non-sofic groups and $\omega$-non-sofic groups. For minimal non-sofic groups, we establish strong…

Group Theory · Mathematics 2026-05-18 Kıvanç Ersoy

The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…

Logic in Computer Science · Computer Science 2016-04-19 Tomer Kotek , Helmut Veith , Florian Zuleger

Assume ZF (without the Axiom of Choice). Let $j:V_\varepsilon\to V_\delta$ be a non-trivial $\in$-cofinal $\Sigma_1$-elementary embedding, where $\varepsilon,\delta$ are limit ordinals. We prove some restrictions on the constructibility of…

Logic · Mathematics 2020-12-21 Farmer Schlutzenberg

The tensor train decomposition decomposes a tensor into a "train" of 3-way tensors that are interconnected through the summation of auxiliary indices. The decomposition is stable, has a well-defined notion of rank and enables the user to…

Numerical Analysis · Computer Science 2018-11-12 Kim Batselier

A simple proof of the fact that each rank-one infinite measure preserving (i.m.p.) transformation is subsequence weakly rationally ergodic is found. Some classes of funny rank-one i.m.p. actions of Abelian groups are shown to be subsequence…

Dynamical Systems · Mathematics 2019-02-20 Alexandre I. Danilenko

In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…

Other Computer Science · Computer Science 2008-02-21 Alexis Ballier , Bruno Durand , Emmanuel Jeandel

Let M be a polynomially bounded, o-minimal structure with archimedean prime model, for example if M is a real closed field. Let C be a convex and unbounded subset of M. We determine the first order theory of the structure M expanded by the…

Logic · Mathematics 2007-05-23 Marcus Tressl

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

Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…

‹ Prev 1 8 9 10 Next ›