中文
相关论文

相关论文: A Note on Planar and Dismantlable Lattices

200 篇论文

We completely determine all commutative semigroup varieties that are cancellable elements of the lattice SEM of all semigroup varieties. In particular, we prove that, for commutative varieties, the properties of being cancellable and…

群论 · 数学 2020-01-22 Sergey V. Gusev , Dmitry V. Skokov , Boris M. Vernikov

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

逻辑 · 数学 2024-11-20 Richard A. Shore , Bjørn Kjos-Hanssen

We prove that the Bruhat-Chevalley-Renner order on the rook monoid is EL-shellable. We determine the homeomorphism type of the associated order complex.

组合数学 · 数学 2019-06-26 Mahir Bilen Can

We prove a relative version of the fact that semiorthogonal decompositions of the bounded derived category of coherent sheaves are strongly constrained by the base locus of the canonical linear system. As an application we prove that the…

代数几何 · 数学 2023-04-28 Shinnosuke Okawa

It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree…

Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and…

环与代数 · 数学 2021-04-29 Kirby A. Baker , George Grätzer

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

表示论 · 数学 2017-01-17 Peng He , Xue-ping Wang

We prove that an irreducible lattice in a real semi-simple Lie group of real rank at least two and finite center is not left-orderable.

群论 · 数学 2020-08-26 Bertrand Deroin , Sebastian Hurtado

Let $L$ be a finite lattice and let $I$ be an ideal of $L$. Then the restriction map is a bounded lattice homomorphism of the congruence lattice of~$L$ into the congruence lattice of $I$. In a 2009 paper, the authors proved the converse. In…

环与代数 · 数学 2022-01-11 George Grätzer , Harry Lakser

We present old and recent results on rank problems and linearizability of geodesic planar webs.

微分几何 · 数学 2008-12-03 Vladislav V. Goldberg , Valentin V. Lychagin

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

A digraph X=(V, E) is max-\lambda, if \lambda(X)=\delta(X). A digraph X is super-\lambda if every minimum cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this paper, we will prove that for all…

组合数学 · 数学 2014-02-21 Yuhu Liu , Jixiang Meng

We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged…

Let $H$ be a group acting on a simply-connected diagrammatically reducible combinatorial 2-complex $X$ with fine 1-skeleton. If the fixed point set $X^ H$ is non-empty, then it is contractible. Having fine 1-skeleton is a weaker version of…

群论 · 数学 2021-07-09 Shivam Arora , Eduardo Martínez-Pedroza

A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…

组合数学 · 数学 2020-09-28 Radhika Gupta , Ivan Levcovitz , Alexander Margolis , Emily Stark

In this work we characterize branch data of branched coverings of even degree over the projective plane which are realizable by indecomposable branched coverings.

几何拓扑 · 数学 2010-05-05 Natalia A. Viana Bedoya , Daciberg Lima Gonçalves

A net $(x_\alpha)$ in a Banach lattice $X$ is said to un-converge to a vector $x$ if $\bigl\lVert\lvert x_\alpha-x\rvert\wedge u\bigr\rVert\to 0$ for every $u\in X_+$. In this paper, we investigate un-topology, i.e., the topology that…

泛函分析 · 数学 2017-01-24 M. Kandić , M. A. A. Marabeh , V. G. Troitsky

Flat surfaces that correspond to $k$-differentials on compact Riemann surfaces are of finite area provided there is no pole of order $k$ or higher. We denote by \textit{flat surfaces with poles of higher order} those surfaces with flat…

几何拓扑 · 数学 2017-12-07 Guillaume Tahar

The finite Young lattice $L(m, n)$ is rank-symmetric, rank-unimodal, and has the strong Sperner property. R. Stanley further conjectured that $L(m, n)$ admits a symmetric chain order. We show that the order structure on $L(m, n)$ is…

组合数学 · 数学 2024-07-30 Terrance Coggins , Robert W. Donley , Ammara Gondal , Arnav Krishna

We prove that a Latt' es map admits an eventually simply-connected wandering continuum precisely when it is flexible. The simply-connected wandering continuum is a line segment in a bi-infinite geodesic under the flat metric.

动力系统 · 数学 2015-07-21 Guizhen Cui , Yan Gao