English
Related papers

Related papers: Infinite Atomized Semilattices

200 papers

In this note, we discuss planar lattices generated by their atoms. We prove that if $L$ is a planar lattice generated by $n$ atoms, then both the left and the right boundaries of $L$ have at most $n+1$ elements. On the other hand, $L$ can…

Rings and Algebras · Mathematics 2021-04-29 G. Grätzer

This paper introduces the notions of atoms and atomicity in $C$-algebras and obtains a characterisation of atoms in the $C$-algebra of transformations. Further, this work presents some necessary conditions and sufficient conditions for the…

Logic in Computer Science · Computer Science 2018-04-03 Gayatri Panicker , K. V. Krishna , Purandar Bhaduri

Orbital semilattices are introduced as bounded semilattices that are, in addition, equipped with an outer multiplication (a semigroup action) and diagonals (a concept borrowed from cylindric algebra), where each semilattice element has a…

General Mathematics · Mathematics 2022-06-17 Jens Kötters , Stefan E. Schmidt

We prove that the semigroup generated by a finite state Mealy automaton $\mathcal{A}=(Q,A,\tau)$ is infinite if and only if there exists some right-infinite word in the alphabet $A$ with infinite orbit.

Group Theory · Mathematics 2018-01-31 Dominik Francoeur

We give a direct construction of a specific idempotent in the endomorphism algebra of a finite lattice $T$. This idempotent is associated with all possible sublattices of $T$ which are total orders.

Rings and Algebras · Mathematics 2025-08-24 Serge Bouc , Jacques Thévenaz

This paper gives a complete characterization of infinitely divisible semimartingales, i.e., semimartingales whose finite dimensional distributions are infinitely divisible. An explicit and essentially unique decomposition of such…

Probability · Mathematics 2014-05-02 Andreas Basse-O'Connor , Jan Rosinski

The problem of determining which infinite lattices are (isomorphic to) sublattices of free lattices is in general unsolved and extremely difficult. In this note, we reduce the problem by proving that all locally finite sublattices of free…

Combinatorics · Mathematics 2021-04-28 Brian T. Chan

Let $S$ be a multiplicatively idempotent congruence-simple semiring. We show that $|S|=2$ if $S$ has a multiplicatively absorbing element. We also prove that if $S$ is finite then either $|S|=2$ or $S\cong End(L)$ or $S^{op}\cong End(L)$…

Rings and Algebras · Mathematics 2022-07-19 Tomáš Kepka , Miroslav Korbelář , Günter Landsmann

We study centralizer clones of finite lattices and semilattices. For semilattices, we give two characterizations of the centralizer and also derive formulas for the number of operations of a given essential arity in the centralizer. We also…

Rings and Algebras · Mathematics 2020-01-15 Endre Tóth , Tamás Waldhauser

In the first section of the present work, we introduce the concept of pseudocomplementation for semirings and show semiring version of some known results in lattice theory. We also introduce semirings with pc-functions and prove some…

Commutative Algebra · Mathematics 2018-04-17 Peyman Nasehpour

For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces have, among other reasons, appeared as a means of constructing structures with lattices of equivalence relations embedding $\Lambda$. This makes use of an isomorphism of…

Rings and Algebras · Mathematics 2020-02-26 Samuel Braunfeld

Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic programs and their partial correctness. Demonic calculus, introduced to model the behaviour of a machine where the demon is in control of…

Logic in Computer Science · Computer Science 2021-05-17 Robin Hirsch , Jaš Šemrl

In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless…

Formal Languages and Automata Theory · Computer Science 2022-12-20 Jean-Paul Allouche , Michel Mendès France

Optical lattices can be loaded with atoms which can have strong interactions, such that the interaction of atoms at different lattice sites cannot be neglected. Moreover, the intersite interactions can be so strong that it can force the…

Quantum Gases · Physics 2020-08-04 V. I. Yukalov

There are ten distinct two-element semirings up to isomorphism, denoted \( L_2, R_2, M_2, D_2, N_2, T_2, Z_2, W_2, Z_7 \), and \( Z_8 \) (see \cite{bk}). Among these, the multiplicative reductions of \( M_2, D_2, W_2 \), and \( Z_8 \) form…

Group Theory · Mathematics 2025-07-14 Aifa Wang , Lili Wang

We formulate an alternative approach to describing Ehresmann semigroups by means of left and right \'etale actions of a meet semilattice on a category. We also characterize the Ehresmann semigroups that arise as the set of all subsets of a…

Category Theory · Mathematics 2021-04-21 Mark V Lawson

One-dimensional superlattices with periodic spatial modulations of onsite potentials or tunneling coefficients can exhibit a variety of properties associated with topology or symmetry. Recent developments of ring-shaped optical lattices…

Quantum Gases · Physics 2018-02-21 Yan He , Kevin Wright , Said Kouachi , Chih-Chun Chien

Each finite algebra $\mathbf A$ induces a lattice~$\mathbf L_{\mathbf A}$ via the quasi-order~$\to$ on the finite members of the variety generated by~$\mathbf A$, where $\mathbf B \to \mathbf C$ if there exists a homomorphism from $\mathbf…

Rings and Algebras · Mathematics 2016-12-20 Brian A. Davey , Charles T. Gray , Jane G. Pitkethly

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…

Logic · Mathematics 2020-11-11 Michael C. Laskowski , Caroline A. Terry

We consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which…

Combinatorics · Mathematics 2024-02-12 V. Ironmonger , N. Ruskuc