English
Related papers

Related papers: Mockingbird lattices

200 papers

We utilize degenerate perturbation theory to investigate continuous-time quantum search on second-order truncated simplex lattices. In this work, we show that the construction of the Hamiltonian must consider the structure of the lattice.…

Quantum Physics · Physics 2023-11-15 Dezheng Zhang , Xuanmin Zhu , Yuanchun Deng , Runping Gao , Qun Wei , Zijiang Luo

Moir\'e effects in twisted or lattice-incommensurate vertical assemblies of two-dimensional crystals give rise to a new class of quantum materials with rich transport and optical phenomena, including correlated electron physics in flat…

For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…

Representation Theory · Mathematics 2018-10-03 Farid Aliniaeifard , Nathaniel Thiem

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Rings and Algebras · Mathematics 2013-04-02 G. Grätzer , E. T. Schmidt

Laplante-Anfossi associated to each rooted plane tree a polytope called an operahedron. He also defined a partial order on the vertex set of an operahedron and asked if the resulting poset is a lattice. We answer this question in the…

Combinatorics · Mathematics 2024-02-21 Colin Defant , Andrew Sack

Gr\"atzer asked in 1971 for a characterization of sublattices of Tamari lattices (associahedra). A natural candidate was coined by McKenzie in 1972 with the notion of a bounded homomorphic image of a free lattice---in short, bounded…

Combinatorics · Mathematics 2013-04-24 Luigi Santocanale , Friedrich Wehrung

We investigate the Hubbard Hamiltonian on ladders where the number of sites per rung alternates between two and three. These geometries are bipartite, with a non-equal number of sites on the two sublattices. Thus they share a key feature of…

Strongly Correlated Electrons · Physics 2021-05-05 Kaouther Essalah , Ali Benali , Anas Abdelwahab , Eric Jeckelmann , Richard T. Scalettar

We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…

Logic · Mathematics 2023-06-02 Nick Galatos , Sara Ugolini

In this paper we discuss the properties of the biordered set obtained from a complemented modular lattice and defines an operation using the sandwich elements of the biordered set. Further we describe a biordered subset satisfying certain…

Rings and Algebras · Mathematics 2020-06-04 P. G. Romeo , Akhila. R

A consistent guiding-center Hamiltonian theory is derived by Lie-transform perturbation method, with terms up to second order in magnetic-field nonuniformity. Consistency is demonstrated by showing that the guiding-center transformation…

Plasma Physics · Physics 2015-12-09 Natalia Tronko , Alain Brizard

We resolve a question of Gillespie, Griffin, and Levinson that asks for a combinatorial bijection between two classes of trivalent trees, tournament trees and slide trees, that both naturally arise in the intersection theory of the moduli…

Combinatorics · Mathematics 2025-04-25 Andrew Reimer-Berg

A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…

Combinatorics · Mathematics 2022-05-10 Robert G. Donnelly

Given a nonnegative integer $m$ and a finite collection ${\mathcal A}$ of linear forms on ${\mathbb Q}^d$, the arrangement of affine hyperplanes in ${\mathbb Q}^d$ defined by the equations $\alpha(x) = k$ for $\alpha \in {\mathcal A}$ and…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis

The first two Hamiltonian structures and the recursion operator connecting all evolution systems and Hamiltonian structures of the N=2 supersymmetric (n,m)-GNLS hierarchy are constructed in terms of N=2 superfields in two different…

High Energy Physics - Theory · Physics 2009-10-30 L. Bonora , A. Sorin

Neighborhood regression has been a successful approach in graphical and structural equation modeling, with applications to learning undirected and directed graphical models. We extend these ideas by defining and studying an algebraic…

Statistics Theory · Mathematics 2019-02-07 Arash A. Amini , Bryon Aragam , Qing Zhou

A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for lattices that are simple, efficient, and nearly optimal in terms…

Data Structures and Algorithms · Computer Science 2020-06-17 J. Ian Munro , Bryce Sandlund , Corwin Sinnamon

We study the Whitney numbers of the first kind of combinatorial geometries. The first part of the paper is devoted to general results relating the M\"{o}bius functions of nested atomistic lattices, extending some classical theorems in…

Combinatorics · Mathematics 2019-09-24 Alberto Ravagnani

We investigate a construction of an integral residuated lattice starting from an integral residuated lattice and two sets with an injective mapping from one set into the second one. The resulting algebra has a shape of a Chinese cascade…

Rings and Algebras · Mathematics 2017-07-04 Michal Botur , Anatolij Dvurečenskij

We survey systematic approaches to basis-restricted fragments of propositional logic and modal logics, with an emphasis on how expressive power and computational complexity depend on the allowed operators. The propositional case is…

Logic in Computer Science · Computer Science 2026-03-06 Nick Bezhanishvili , Balder ten Cate , Arunavo Ganguly , Arne Meier
‹ Prev 1 8 9 10 Next ›