English
Related papers

Related papers: Algebraic structures arising from the finite conde…

200 papers

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

In the paper we investigate the semigroup of monotone co-finite partial homeomorphisms of the space of the usual real line $\mathbb{R}$. We prove that the inverse semigroup $\mathscr{P\!\!H}^+_{\!\!\operatorname{\textsf{cf}}}\!(\mathbb{R})$…

Group Theory · Mathematics 2019-04-16 Oleg Gutik , Kateryna Melnyk

Let $\mathbf{F}=\left\langle F,R\right\rangle $ be a finite Kripke frame. A congruence of $\mathbf{F}$ is a bisimulation of $\mathbf{F}$ that is also an equivalence relation on F. The set of all congruences of $\mathbf{F}$ is a lattice…

We consider vector lattices endowed with locally solid convergence structures, which are not necessarily topological. We show that such a convergence is defined by the convergence to $0$ on the positive cone. Some results on unbounded…

Functional Analysis · Mathematics 2024-03-13 Eugene Bilokopytov

Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call…

Dynamical Systems · Mathematics 2020-12-29 Udayan B. Darji , Daniel Gonçalves , Marcelo Sobottka

Given a special biserial algebra $\Lambda$ over an algebraically closed field, let $\mathrm{rad}_\Lambda$ denote the radical of its module category. The authors showed with Sinha that the stable rank of a special biserial algebra $\Lambda$,…

Representation Theory · Mathematics 2024-07-03 Suyash Srivastava , Amit Kuber

In classical set theory, there are many equivalent ways to introduce ordinals. In a constructive setting, however, the different notions split apart, with different advantages and disadvantages for each. We consider three different notions…

Logic in Computer Science · Computer Science 2022-08-04 Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

Scheme-theoretic methods are used to classify ternary quadratic forms with values in line bundles over arbitrary schemes and to canonically determine the isomorphisms between them. The association of a quadratic bundle to its even Clifford…

Algebraic Geometry · Mathematics 2007-05-23 Venkata Balaji Thiruvalloor Eesanaipaadi

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

Logic · Mathematics 2026-02-12 Tumadhir Alsulami , Marcel Jackson

It is well known that the composition of a D-finite function with an algebraic function is again D-finite. We give the first estimates for the orders and the degrees of annihilating operators for the compositions. We find that the analysis…

Symbolic Computation · Computer Science 2017-05-29 Manuel Kauers , Gleb Pogudin

The weak operator topology closed operator algebra on $L^2(R)$ generated by the one-parameter semigroups for translation, dilation and multiplication by $exp(i\lambda x), \lambda \geq 0$, is shown to be a reflexive operator algebra, in the…

Operator Algebras · Mathematics 2015-03-06 Eleftherios Kastis , Stephen Power

We develop the fine structure theory of operator-premice. These are a generalization of standard premice, in which an abstract operator $F$ is used to form the successor steps in the internal hierarchy of the premouse, instead of Jensen's…

Logic · Mathematics 2025-05-14 Farmer Schlutzenberg , Nam Trang

First of all, we recall the well known notion of semidirect product both for classical algebraic structures (like groups and rings) and for more recent ones (digroups, left skew braces, heaps, trusses). Then we analyse the concept of…

Rings and Algebras · Mathematics 2023-11-09 Alberto Facchini , David Stanovský

We propose a framework for fusion category symmetry on the (1+1)D lattice in the infinite-volume limit by giving a formal interpretation of SymTFT decompositions. Our approach is based on axiomatizing physical boundary subalgebra of…

Mathematical Physics · Physics 2026-04-17 David E. Evans , Corey Jones

We describe the orbit structure for the action of the centralizer group of a linear operator on a finite-dimensional complex vector space. The main application is to the classification of solutions to a system of first-order ODEs with…

Dynamical Systems · Mathematics 2012-05-15 Paul Best , Marco Gualtieri , Patrick Hayden

For a finite-dimensional algebra {\Lambda}, we establish an explicit bijection between widely generated torsion(-free) classes and semibricks in mod {\Lambda}. Using the kappa order on the lattice of torsion classes with canonical join…

Representation Theory · Mathematics 2026-02-17 Alireza Nasr-Isfahani

In this paper we consider the $f$-orthomorphisms and $f$-linear operators on the order dual of an $f$-algebra. In particular, when the $f$-algebra has the factorization property (not necessarily unital), we prove that the orthomorphisms,…

Functional Analysis · Mathematics 2013-07-19 Ying Feng , Jin Xi Chen , Zi Li Chen

Consider a normal function $f$ on the ordinals (i. e. a function $f$ that is strictly increasing and continuous at limit stages). By enumerating the fixed points of $f$ we obtain a faster normal function $f'$, called the derivative of $f$.…

Logic · Mathematics 2021-07-09 Anton Freund , Michael Rathjen

In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…

Combinatorics · Mathematics 2015-12-07 Istvan Heckenberger , John Shareshian , Volkmar Welker

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

Logic in Computer Science · Computer Science 2025-10-22 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu