English
Related papers

Related papers: Iteratively algebraic orders

200 papers

A classification theorem is obtained for a class of unital simple separable amenable Z-stable C*-algebras which exhausts all possible values of the Elliott invariant for unital stably finite simple separable amenable Z-stable C*-algebras.…

Operator Algebras · Mathematics 2021-05-05 Guihua Gong , Huaxin Lin , Z. Niu

In this paper we show an index theorem for gerbes

Differential Geometry · Mathematics 2007-05-23 Aristide Tsemo , Isaac Woungang

Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…

Combinatorics · Mathematics 2026-03-17 Dale R. Worley

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…

Dynamical Systems · Mathematics 2015-02-24 David Damanik , Daniel Lenz

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

Logic · Mathematics 2007-05-23 Peter Cholak , Leo Harrington

The aim of this short note is to present an elementary, self-contained, and direct proof for the classical Lebesgue decomposition theorem.

Functional Analysis · Mathematics 2014-04-08 Tamás Titkos

Let P be a convex polytope containing the origin, whose dual is a lattice polytope. Hibi's Palindromic Theorem tells us that if P is also a lattice polytope then the Ehrhart $\delta$-vector of P is palindromic. Perhaps less well-known is…

Combinatorics · Mathematics 2022-10-28 Matthew H. J. Fiset , Alexander M. Kasprzyk

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

Formal Languages and Automata Theory · Computer Science 2011-11-03 Michał Skrzypczak

We prove a uniformization theorem in complex algebraic geometry.

Algebraic Geometry · Mathematics 2010-08-11 Robert Treger

The relative index theorem is proved for general first-order elliptic operators that are complete and coercive at infinity over measured manifolds. This extends the original result by Gromov-Lawson for generalised Dirac operators as well as…

Analysis of PDEs · Mathematics 2022-10-31 Lashi Bandara

We show that lattice isomorphisms between lattices of slowly oscillating functions on chain-connected proper metric spaces induce coarsely equivalent homeomorphisms. This result leads to a Banach-Stone-like theorem for these lattices.…

General Topology · Mathematics 2025-03-10 Yutaka Iwamoto

This work concerns the study of properties of a group of Koszul algebras coming from the toric ideals of a chordal bipartite infinite family of graphs (alternately, these rings may be interpreted as coming from determinants of certain…

Commutative Algebra · Mathematics 2021-02-18 Laura Ballard

We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…

Data Structures and Algorithms · Computer Science 2010-03-30 Antonio Ignacio Vera

In this paper it is shown that the lattice of C*-covers of an operator algebra does not contain enough information to distinguish operator algebras up to completely isometric isomorphism. In addition, four natural equivalences of the…

Operator Algebras · Mathematics 2025-01-16 Adam Humeniuk , Christopher Ramsey

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

Combinatorics · Mathematics 2010-04-26 Jean Yves Semegni , Marcel Wild

For a locally compact abelian group $G$ a simple proof is given for the known fact that a bounded domain $\Omega$ tiles $G$ with translations by a lattice $\Lambda$ if and only if the set of characters of $G$ indexed by the dual lattice of…

Functional Analysis · Mathematics 2016-07-05 Davide Barbieri , Eugenio Hernández , Azita Mayeli

This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…

Discrete Mathematics · Computer Science 2016-12-20 Giovanni Rossi

We give a dynamical, relatively elementary proof of an "absorption theorem" which is closely related to a well-known result due to Matui. The construction is in the spirit of an earlier joint work of the author and S. Robert. In an appendix…

Dynamical Systems · Mathematics 2025-01-30 Julien Melleray

The representation theorem for odd or even involutive FLe-chains by bunches of layer groups, as discussed in [10], is redefined to demonstrate a more straightforward constructional relationship between odd or even involutive FLe-chains and…

Logic · Mathematics 2023-12-12 Sándor Jenei

I give a short proof of the following algebraic statement: if a vertex algebra is simple, then its underlying Lie conformal algebra is either abelian, or it is an irreducible central extension of a simple Lie conformal algebra.

Quantum Algebra · Mathematics 2012-10-19 Alessandro D'Andrea