English
Related papers

Related papers: Multiple CSLs for the body centered cubic lattice

200 papers

The systematic study of planar semimodular lattices started in 2007 with a series of papers by G. Gr\"atzer and E. Knapp. These lattices have connections with group theory and geometry. A planar semimodular lattice $L$ is {\it slim} if…

Rings and Algebras · Mathematics 2021-03-09 Gábor Czédli , George Grätzer

We propose the use of optical lattice clocks operated with fermionic alkaline-earth-atoms to study spin-orbit coupling (SOC) in interacting many-body systems. The SOC emerges naturally during the clock interrogation when atoms are allowed…

Several methods of triclustering of three dimensional data require the specification of the cluster size in each dimension. This introduces a certain degree of arbitrariness. To address this issue, we propose a new method, namely the…

Machine Learning · Computer Science 2021-09-23 Dina Faneva Andriantsiory , Joseph Ben Geloun , Mustapha Lebbah

We consider supersymmetric conformal quantum field theories (SCFTs) with degrees of freedom labeled by lattice data. We will assume that in terms of the corresponding lattice the interactions are nearest neighbor and exactly marginal. For…

High Energy Physics - Theory · Physics 2025-02-21 Shlomo S. Razamat , Michal Shemesh , Aelly Zeltzer

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…

Rings and Algebras · Mathematics 2012-08-31 Gábor Czédli , Tamás Dékány , László Ozsvárt , Nóra Szakács , Balázs Udvari

Aiming at the study of critical phenomena in the presence of boundaries with a non-trivial shape we discuss how lattices with an adaptive lattice spacing can be implemented. Since the parameters of the Hamiltonian transform non-trivially…

Statistical Mechanics · Physics 2015-03-25 Martin Hasenbusch

A classification algorithm, called the Linear Centralization Classifier (LCC), is introduced. The algorithm seeks to find a transformation that best maps instances from the feature space to a space where they concentrate towards the center…

Machine Learning · Computer Science 2017-12-25 Mohammad Reza Bonyadi , Viktor Vegh , David C. Reutens

The linear classifier is widely used in various image classification tasks. It works by optimizing the distance between a sample and its corresponding class center. However, in real-world data, one class can contain several local clusters,…

Computer Vision and Pattern Recognition · Computer Science 2024-01-30 Zhemin Zhang , Xun Gong

We study the large class of solvable lattice models, based on the data of conformal field theory. These models are constructed from any conformal field theory. We consider the lattice models based on affine algebras described by Jimbo et…

High Energy Physics - Theory · Physics 2022-10-20 Vladimir Belavin , Doron Gepner , J. Ramos Cabezas

In a recent work of Duke, Imamo\={g}lu, and T\'{o}th, the linking number of certain links on the space $\text{SL}(2,\mathbb{Z})\backslash\text{SL}(2,\mathbb{R})$ is investigated. This linking number has an alternative interpretation as the…

Number Theory · Mathematics 2021-06-02 James Rickards

We consider two-dimensional lattice equations defined on an elementary square of the Cartesian lattice and depending on the variables at the corners of the quadrilateral. For such equations the property often associated with integrability…

Exactly Solvable and Integrable Systems · Physics 2019-03-12 Jarmo Hietarinta

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain an ${\mathsf M}_3$-sublattice). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are complementary $a, b \in I$ such that $a$ is to the…

Rings and Algebras · Mathematics 2022-07-05 George Grätzer

Suppose $\Omega\subseteq\RR^d$ is a bounded and measurable set and $\Lambda \subseteq \RR^d$ is a lattice. Suppose also that $\Omega$ tiles multiply, at level $k$, when translated at the locations $\Lambda$. This means that the…

Classical Analysis and ODEs · Mathematics 2013-05-14 Mihail N. Kolountzakis

We introduce maximal and average coherence on lattices by analogy with these notions on frames in Euclidean spaces. Lattices with low coherence can be of interest in signal processing, whereas lattices with high orthogonality defect are of…

Number Theory · Mathematics 2023-06-22 Lenny Fukshansky , David Kogan

We study percolation and the random cluster model on the triangular lattice with 3-body interactions. Starting with percolation, we generalize the star--triangle transformation: We introduce a new parameter (the 3-body term) and identify…

Statistical Mechanics · Physics 2009-11-11 L. Chayes , H. K. Lei

The entanglement properties of some novel quantum systems are studied that are inspired by recent developments in cold-atom technology. A triangular optical lattice of two atomic species can be employed to generate a variety of spin-1/2…

Quantum Physics · Physics 2007-05-23 Jiannis K. Pachos

An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…

Computational Geometry · Computer Science 2020-01-17 Stefan Felsner , Manfred Scheucher

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 show that spin correlations of atoms in an optical lattice can be reconstructed by coupling the system to the light, and by measuring correlations between the emitted photons. This principle is the basis for a method to characterize…

Quantum Physics · Physics 2017-08-17 Ines de Vega , J. Ignacio Cirac , D. Porras

By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…

Rings and Algebras · Mathematics 2026-02-05 Gábor Czédli