English
Related papers

Related papers: A Note on the Set-Theoretic Representation of Arbi…

200 papers

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…

Metric Geometry · Mathematics 2013-09-17 Richard J. Mathar

Diversities are a generalization of metric spaces, where instead of the non-negative function being defined on pairs of points, it is defined on arbitrary finite sets of points. Diversities have a well-developed theory. This includes the…

Metric Geometry · Mathematics 2020-10-23 David Bryant , Raúl Felipe , Mauricio Toledo-Acosta , Paul Tupper

In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…

Combinatorics · Mathematics 2017-08-08 Henri Mühle

We consider string junctions with endpoints on a set of branes of IIB string theory defining an ADE-type gauge Lie algebra. We show how to characterize uniquely equivalence classes of junctions related by string/brane crossing through…

High Energy Physics - Theory · Physics 2009-10-31 Oliver DeWolfe , Barton Zwiebach

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

A given question can be defined in terms of the set of statements or assertions that answer it. Application of logical inference to these sets of assertions allows one to derive the logic of inquiry among questions. There are interesting…

Data Analysis, Statistics and Probability · Physics 2009-11-10 Kevin H. Knuth

We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…

Logic in Computer Science · Computer Science 2024-09-05 Eike Neumann , Arno Pauly , Cécilia Pradic

A mixture of light and heavy spin-polarized fermionic atoms in an optical lattice is considered. Tunneling of the heavy atoms is neglected such that they are only subject to thermal fluctuations. This results in a complex interplay between…

Disordered Systems and Neural Networks · Physics 2009-11-11 K. Ziegler

We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…

Logic · Mathematics 2018-02-28 Beibut Kulpeshov , Sergey Sudoplatov

Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through…

Rings and Algebras · Mathematics 2021-06-03 Luciano J. González , Ismael Calomino

We review a few results concerning interpolation of monotone functions on infinite lattices, emphasizing the role of set-theoretic considerations. We also discuss a few open problems.

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern

The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…

Rings and Algebras · Mathematics 2014-02-03 Primož Škraba , João Pita Costa

Ariki's and Grojnowski's approach to the representation theory of affine Hecke algebras of type $A$ is applied to type $B$ with unequal parameters to obtain -- under certain restrictions on the eigenvalues of the lattice operators --…

Representation Theory · Mathematics 2007-09-27 Vanessa Miemietz

Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched…

Logic in Computer Science · Computer Science 2012-01-23 Pascal Hitzler , Markus Krötzsch , Guo-Qiang Zhang

The theory of bounded, distributive lattices provides the appropriate language for describing directionality and asymptotics in dynamical systems. For bounded, distributive lattices the general notion of `set-difference' taking values in a…

Dynamical Systems · Mathematics 2019-11-22 William D. Kalies , Konstantin Mischaikow , Robert C. A. M. Vandervorst

The lattice definition of a two-dimensional topological field theory (TFT) is given generically, and the exact solution is obtained explicitly. In particular, the set of all lattice topological field theories is shown to be in one-to-one…

High Energy Physics - Theory · Physics 2009-10-22 M. Fukuma , S. Hosono , H. Kawai

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

Combinatorics · Mathematics 2021-03-08 Matthieu Latapy , Thi Ha Duong Phan

We consider two constructions of an envelope for a finite locally distributive strong upper semilattice. The first is based on Birkhoff's representation of finite distributive lattices and the second on valuations on lattices. We show that…

Combinatorics · Mathematics 2009-02-03 Colin Bailey , Joseph Oliveira

It is shown that the set of all finitary consequence operators defined on any nonempty language is a join-complete lattice. This result is applied to various collections of physical theories to obtain an unrestricted supremum unification.

General Physics · Physics 2014-11-18 Robert A. Herrmann