English
Related papers

Related papers: Meeting Covered Elements in $\nu$-Tamari Lattices

200 papers

Given any finite subset $A$ of order $n$ of a distributive lattice and $k\in\{1,...,n\}$, there is a natural extension of the median operation to $n$ variables which generalizes the notion of the $k$th smallest element of $A$. By applying…

Functional Analysis · Mathematics 2022-07-04 Christopher Michael Schwanke

We introduce a new disordered system, the Super-Potts model, which is a more frustrated version of the Potts glass. Its elementary degrees of freedom are variables that can take M values and are coupled via pair-wise interactions. Its exact…

Disordered Systems and Neural Networks · Physics 2015-01-15 Maria Chiara Angelini , Giulio Biroli

Let A be a subspace arrangement with a geometric lattice such that codim(x) > 1 for every x in A. Using rational homotopy theory, we prove that the complement M(A) is rationally elliptic if and only if the sum of the orthogonal subspaces is…

Algebraic Topology · Mathematics 2007-05-23 G. Debongnie

We show how to use polar molecules in an optical lattice to engineer quantum spin models with arbitrary spin S >= 1/2 and with interactions featuring a direction-dependent spin anisotropy. This is achieved by encoding the effective spin…

We explore some of the properties of a subposet of the Tamari lattice introduced by Pallo, which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within…

Combinatorics · Mathematics 2019-07-25 Sebastian A. Csar , Rik Sengupta , Warut Suksompong

In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…

Optimization and Control · Mathematics 2026-05-05 TaeHo Yoon , Benjamin Grimmer

We show that contact-rich motion planning is also sparsity-rich when viewed as polynomial optimization (POP). We can exploit not only the correlative and term sparsity patterns that are general to all POPs, but also specialized sparsity…

Robotics · Computer Science 2025-09-08 Shucheng Kang , Guorui Liu , Heng Yang

We study several separation axioms for $X$-top-lattices (i.e. a lattice $L$ for which a given subset $X\subseteq L\backslash \{1\}$ admits a \emph{% Zariski-like topology}). Such spaces are $T_{0}$ and usually far away from being $T_{2}.$…

Rings and Algebras · Mathematics 2026-01-14 Jawad Abuhlail , Abdulmushin Alfaraj

The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix $B$ under this partial order via isomorphisms with two different…

Rings and Algebras · Mathematics 2024-12-30 Cecilia R. Cimadamore , Laura A. Rueda , Néstor Thome , Melina V. Verdecchia

We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…

Combinatorics · Mathematics 2023-05-08 Alejandro Vargas

Let $V$ be a projective variety defined over a number field $K$, let $S$ be a polarized set of endomorphisms of $V$ all defined over $K$, and let $P\in V(K)$. For each prime $\mathfrak{p}$ of $K$, let $m_{\mathfrak{p}}(S,P)$ denote the…

Number Theory · Mathematics 2023-11-08 Wade Hindes , Joseph H. Silverman

We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never…

Discrete Mathematics · Computer Science 2025-03-12 Lapo Cioni , Luca Ferrari , Rebecca Smith

We prove the following result: Theorem. Every algebraic distributive lattice D with at most $\aleph\_1$ compact elements is isomorphic to the ideal lattice of a von Neumann regular ring R. (By earlier results of the author, the $\aleph\_1$…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Omer Gimenez

Let (L_i : i\in I) be a family of lattices in a nontrivial lattice variety V, and let \phi_i: L_i --> M, for i\in I, be isotone maps (not assumed to be lattice homomorphisms) to a common lattice M (not assumed to lie in V). We show that the…

Rings and Algebras · Mathematics 2013-05-10 G. M. Bergman , G. Grätzer

We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…

Discrete Mathematics · Computer Science 2026-04-28 Julian Müller

We study planar two-dimensional quantum systems on a lattice whose Hamiltonian is a sum of local commuting projectors of bounded range. We consider whether or not such a system has a zero energy ground state. To do this, we consider the…

Quantum Physics · Physics 2016-12-15 M. B. Hastings

In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…

Logic · Mathematics 2018-10-22 Sergio A. Celani , Ma. Paula Menchón

A lattice model of critical dense polymers is solved exactly for arbitrary system size on the torus. More generally, an infinite family of lattice loop models is studied on the torus and related to the corresponding Fortuin-Kasteleyn random…

High Energy Physics - Theory · Physics 2015-06-15 Alexi Morin-Duchesne , Paul A. Pearce , Jorgen Rasmussen

We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…

Rings and Algebras · Mathematics 2020-01-15 Kamilla Kátai-Urbán , Tamás Waldhauser
‹ Prev 1 4 5 6 7 8 10 Next ›