English
Related papers

Related papers: A metrizable Lawson semitopological semilattice wi…

200 papers

If a partition of a lattice in R^d is selfsimilar, it is called lattice substitution system (LSS). Such sets represent nonperiodic, but highly ordered structures. An important property of such structures is, whether they are model sets or…

Metric Geometry · Mathematics 2013-10-17 Dirk Frettlöh

We establish several independent results concerning extremal, left modular, congruence uniform, and semidistributive lattices. An equivalent characterization of left modular lattices is obtained in terms of edge-labellings, together with…

Combinatorics · Mathematics 2025-12-01 Adrien Segovia

We calculate, in the continuum limit of quenched lattice QCD, the matrix elements of the heavy-heavy vector current between heavy-light pseudoscalar meson states. We present the form factors for different values of the initial and final…

High Energy Physics - Lattice · Physics 2008-11-26 G. M. de Divitiis , R. Petronzio , N. Tantalo

A coarse space $X$, endowed with a linear order compatible with the coarse structure of $X$, is called linearly ordered. We prove that every linearly ordered coarse space $X$ is locally convex and the asymptotic dimension of $X$ is either…

General Topology · Mathematics 2021-10-05 Igor Protasov

We investigate the problem of describing the homotopy classes $[X,Y]$ of continuous functions between $\omega$-bounded non metrizable manifolds $X,Y$. We define a family of surfaces $X$ built with the first octant $C$ in $L^2$ ($L$ is the…

Geometric Topology · Mathematics 2007-05-23 Mathieu Baillif

In a recent paper, the authors have proved that for lattices A and B with zero, the isomorphism $Conc(A \otimes B)\cong Conc A \otimes Conc B$, holds, provided that the tensor product satisfies a very natural condition (of being…

General Mathematics · Mathematics 2016-08-16 George Grätzer , Friedrich Wehrung

In a recent paper [TMP, 200:1 (2019), 966--984] by the authors, a series of integrable discrete autonomous equations on a square lattice with a non-standard structure of generalized symmetries is constructed. We build modified series by…

Exactly Solvable and Integrable Systems · Physics 2020-12-02 R. N. Garifullin , R. I. Yamilov

Sufficient condition for the stability of a fractional order semi-linear system with multi-time delay is proposed.

Analysis of PDEs · Mathematics 2014-09-16 Supriyo Dutta , N. Sukavanam

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

Combinatorics · Mathematics 2010-04-26 Jean Yves Semegni , Marcel Wild

We classify solvable Lie groups admitting left invariant symplectic half-flat structure. When the Lie group has a compact quotient by a lattice, we show that these structures provide solutions of supersymmetric equations of type IIA.

Differential Geometry · Mathematics 2012-07-25 Marisa Fernández , Víctor Manero , Antonio Otal , Luis Ugarte

We find (completeness type) conditions on topological semilattices $X,Y$ guaranteeing that each continuous homomorphism $h:X\to Y$ has closed image $h(X)$ in $Y$.

General Topology · Mathematics 2021-11-01 Taras Banakh , Serhii Bardyla

We introduce a construction of symmetry-enriched topological orders on bipartite lattices in which two $\mathbb{Z}_2$ spin liquids defined on each sublattice are combined, and then anyons are condensed to reduce the topological order. By…

Strongly Correlated Electrons · Physics 2018-12-19 Jong Yeon Lee , Ari Turner , Ashvin Vishwanath

It is shown that any finite, rank-connected, dismantlable lattice is lexicographically shellable (hence Cohen-Macaulay). A ranked, interval-connected lattice is shown to be rank-connected, but a rank-connected lattice need not be…

Combinatorics · Mathematics 2007-05-23 Karen L. Collins

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

Logic · Mathematics 2008-07-22 Luigi Santocanale

Lattice path matroids form a subclass of transversal matroids and were introduced by Bonin, de Mier and Noy. Transversal matroids are not well-quasi-ordered, even when the branch-width is restricted. Though lattice path matroids are not…

Combinatorics · Mathematics 2018-06-28 Meenu Mariya Jose , Dillon Mayhew

We show that for every quasivariety K of structures (where both functions and relations are allowed) there is a semilattice S with operators such that the lattice of quasi-equational theories of K (the dual of the lattice of…

Rings and Algebras · Mathematics 2012-12-06 Kira Adaricheva , J. B. Nation

We investigate whether the set of subfit elements of a distributive semilattice is an ideal. This question was raised by the second author at the BLAST conference in 2022. We show that in general it has a negative solution, however if the…

General Topology · Mathematics 2025-03-26 Guram Bezhanishvili , James Madden , M. Andrew Moshier , Marcus Tressl , Joanne Walters-Wayland

A topologized semilattice $X$ is called complete if each non-empty chain $C\subset X$ has $\inf C\in\bar C$ and $\sup C\in\bar C$. We prove that for any continuous homomorphism $h:X\to Y$ from a complete topologized semilattice $X$ to a…

General Topology · Mathematics 2021-11-01 Taras Banakh , Serhii Bardyla

In this paper we investigate measures over bounded lattices, extending and giving a unifying treatment to previous works. In particular, we prove that the measures of an arbitrary bounded lattice can be represented as measures over a…

Commutative Algebra · Mathematics 2021-09-20 C. Massri , F. Holik

This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-02-04 Abdullah Rasheed , Nidhi Dubagunta