English
Related papers

Related papers: Finitely Supported Sets Containing Infinite Unifor…

200 papers

We present a self-contained analysis of infinity from two mathematical perspectives: set theory and algebra. We begin with cardinal and ordinal numbers, examining deep questions such as the continuum hypothesis, along with foundational…

History and Overview · Mathematics 2025-05-16 Noah Betz

In this paper I consider locally finite Lie algebras of characteristic zero satisfying the condition that for every finite number of elements $x_{1}, x_{2},..., x_{k}$ of such an algebra $L$ there is finite-dimensional subalgebra $A$ which…

Rings and Algebras · Mathematics 2007-05-23 L. A. Simonian

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Rings and Algebras · Mathematics 2008-10-03 F. Cedo , E. Jespers , J. Okninksi

In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…

Functional Analysis · Mathematics 2020-12-07 Andrzej Olbryś , Zsolt Páles

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

Logic · Mathematics 2025-12-03 Jake Masters

We extend the theory of atomized semilattices to the infinite setting. We show that it is well-defined and that every semilattice is atomizable. We also study atom redundancy, focusing on complete and finitely generated semilattices and…

Commutative Algebra · Mathematics 2025-11-25 Fernando Martin-Maroto , Antonio Ricciardo , David Mendez , Gonzalo G. de Polavieja

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Algebraic Geometry · Mathematics 2016-02-26 Rob Eggermont

We provide an explicit construction for a complete set of orthogonal primitive idempotents of finite group algebras over nilpotent groups. Furthermore, we give a complete set of matrix units in each simple epimorphic image of a finite group…

Representation Theory · Mathematics 2013-02-19 Inneke Van Gelder , Gabriela Olteanu

Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…

Logic in Computer Science · Computer Science 2020-05-29 Ciarán Dunne , J. B. Wells , Fairouz Kamareddine

We study a new proof principle in the context of constructive Zermelo-Fraenkel set theory based on what we will call "non-deterministic inductive definitions". We give applications to formal topology as well as a predicative justification…

Logic · Mathematics 2012-09-17 Benno van den Berg

There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…

General Topology · Mathematics 2021-08-12 Dibyendu De , Pintu Debnath , Sayan Goswami

Algebraic hyperstructures represent a natural extension of classical algebraic structures. In a classical algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two…

Mathematical Physics · Physics 2012-09-12 Akbar Dehghan Nezhad , Mehdi Nadjafikhah , Seyed Mohammad Moosavi Nejad

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…

Logic in Computer Science · Computer Science 2017-01-11 Thomas Colcombet , Christof Löding

A function is boundedly finite-to-one if there is a natural number $k$ such that each point has at most $k$ inverse images. In this paper, we prove in $\mathsf{ZF}$ (i.e., the Zermelo--Fraenkel set theory without the axiom of choice)…

Logic · Mathematics 2025-09-23 Xiao Hu , Guozhen Shen

In this paper we present a new algebraic structure (a super hyperbolic system in our terminology) for finite quantum systems, which is a generalization of the usual one in the two-level system. It fits into the so-called generalized Pauli…

Quantum Physics · Physics 2015-05-13 Kazuyuki Fujii

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

Representation Theory · Mathematics 2013-02-06 Klaus Bongartz

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},\ldots , a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}\cdots a_{n} =a_{\sigma (1)} a_{\sigma (2)} \cdots a_{\sigma (n)}$, where…

Rings and Algebras · Mathematics 2022-03-16 Ferran Cedo , Eric Jespers , Georg Klein

Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…

Logic · Mathematics 2024-12-02 Emanuele Frittaion , Takako Nemoto , Michael Rathjen

We study model geometries of finitely generated groups. If a finitely generated group does not contain a non-trivial finite rank free abelian commensurated subgroup, we show any model geometry is dominated by either a symmetric space of…

Group Theory · Mathematics 2024-09-06 Alex Margolis

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

Logic in Computer Science · Computer Science 2024-11-14 Arka Ghosh , Piotr Hofman , Sławomir Lasota