English
Related papers

Related papers: The embedding structure for linearly ordered topol…

200 papers

Let $\Lambda$ be a finite-dimensional algebra over a field $K$. We describe how Buan and Marsh's $\tau$-exceptional sequences can be used to give a "brick labeling" of a certain poset of wide subcategories of finitely-generated…

Representation Theory · Mathematics 2022-09-26 Emily Barnard , Eric J. Hanson

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

General Mathematics · Mathematics 2026-03-13 Marcoen J. T. F. Cabbolet , Adrian R. D. Mathias

We give a new proof of a theorem of Kleiner-Leeb: that any quasi-isometrically embedded Euclidean space in a product of symmetric spaces and Euclidean buildings is contained in a metric neighborhood of finitely many flats, as long as the…

Geometric Topology · Mathematics 2009-02-26 Kevin Wortman

We establish a fundamental theorem of orders (FTO) which allows us to express all orders uniquely as an intersection of `irreducible orders' along which the index and the conductor distributes multiplicatively. We define a subclass of…

Number Theory · Mathematics 2024-11-19 Gaurav Digambar Patil

The rank of a hierarchically hyperbolic space is the maximal number of unbounded factors in a standard product region. For hierarchically hyperbolic groups, this coincides with the maximal dimension of a quasiflat. Examples for which the…

Geometric Topology · Mathematics 2020-08-25 Jason Behrstock , Mark F Hagen , Alessandro Sisto

We investigate large set axioms defined in terms of elementary embeddings over constructive set theories, focusing on $\mathsf{IKP}$ and $\mathsf{CZF}$. Most previously studied large set axioms, notably the constructive analogues of large…

Logic · Mathematics 2025-03-26 Hanul Jeon , Richard Matthews

In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and…

Logic · Mathematics 2013-07-04 Tarek Sayed Ahmed

It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced…

Logic · Mathematics 2021-08-24 Ivan Chajda , Helmut Länger

In this paper, we compute the posets of wide subcategories and ICE-closed subcategories from the lattice of torsion classes in an abelian length category in a purely lattice-theoretical way, by using the kappa map in a completely…

Representation Theory · Mathematics 2022-01-04 Haruhisa Enomoto

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

Logic · Mathematics 2024-01-29 Wesley Calvert , Douglas Cenzer , David Gonzalez , Valentina Harizanov

Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…

Combinatorics · Mathematics 2014-12-04 Samuel Fiorini , Selim Rexhep

The natural join and the inner union operations combine relations of a database. Tropashko and Spight realized that these two operations are themeet and join operations in a class of lattices, known by now as the relational lattices. They…

Logic in Computer Science · Computer Science 2017-03-10 Luigi Santocanale

Finite topological spaces are in bijective correspondence with preorders on finite sets. We undertake their study using combinatorial tools that have been developed to investigate general discrete structures. A particular emphasis will be…

Algebraic Topology · Mathematics 2015-09-04 Loïc Foissy , Claudia Malvenuto , Frédéric Patras

The distribution of the deformations of elementary cells is studied in an abstract lattice constructed from the existence of the empty set. One combination rule determining oriented sequences with continuity of set-distance function in such…

General Physics · Physics 2007-05-23 Michel Bounias , Volodymyr Krasnoholovets

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…

Logic · Mathematics 2020-10-29 Hossein Lamei Ramandi

Let $X$ be a separable nonquasireflexive Banach space. Let $Y$ be a Banach space isomorphic to a subspace of $X^*$. The paper is devoted to the following questions: 1. Under what conditions does there exist an isomorphic embedding $T:Y\to…

Functional Analysis · Mathematics 2010-09-07 Mikhail I. Ostrovskii

Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…

Statistics Theory · Mathematics 2008-04-14 Akimichi Takemura , Ruriko Yoshida

The homotopy type of the complement manifold of a complexified toric arrangement has been investigated by d'Antonio and Delucchi in a paper that shows the minimality of such topological space. In this work we associate to a given toric…

Combinatorics · Mathematics 2024-10-30 Elia Saini

Given any strong orbit equivalence class of minimal Cantor systems and any cardinal number that is finite, countable, or the continuum, we show that there exists a minimal subshift within the given class whose number of asymptotic…

Dynamical Systems · Mathematics 2025-04-15 Haritha Cheriyath , Sebastián Donoso

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Computational Complexity · Computer Science 2020-05-21 Jeffrey Finkelstein