中文
相关论文

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

200 篇论文

We prove that certain fibered, $-$amphicheiral knots are rationally slice. Moreover, we show that the concordance invariants $\nu^+$ and $\Upsilon(t)$ from Heegaard Floer homology vanish for a class of knots that includes rationally slice…

几何拓扑 · 数学 2018-04-18 Min Hoon Kim , Zhongtao Wu

A join-semilattice $L$ is said to be conjunctive if it has a top element $1$ and it satisfies the following first-order condition: for any two distinct $a,b\in L$, there is $c\in L$ such that either $a\vee c\not=1=b\vee c$ or $a\vee…

逻辑 · 数学 2020-06-09 Charles N. Delzell , Oghenetega Ighedo , James J. Madden

We construct a metrizable semitopological semilattice $X$ whose partial order $P=\{(x,y)\in X\times X:xy=x\}$ is a non-closed dense subset of $X\times X$. As a by-product we find necessary and sufficient conditions for the existence of a…

一般拓扑 · 数学 2021-11-01 Taras Banakh , Serhii Bardyla , Alex Ravsky

We show that in order to decide whether a given probability measure is laminate it is enough to verify Jensen's inequality in the class of extremal non-negative rank-one convex integrands. We also identify a subclass of these extremal…

偏微分方程分析 · 数学 2019-11-12 André Guerra

We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…

综合数学 · 数学 2026-03-23 P. Douka , V. Felouzis

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…

组合数学 · 数学 2015-09-25 Istvan Tomon

In this note, we show that the order convergence in a vector lattice $X$ is not topological unless $\dim X<\infty$. Furthermore, we show that, in atomic order continuous Banach lattices, the order convergence is topological on order…

泛函分析 · 数学 2017-05-30 Y. A. Dabboorasad , E. Y. Emelyanov , M. A. A. Marabeh

In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…

组合数学 · 数学 2026-05-05 Licheng Zhang , Yuanqiu Huang , Zhangdong Ouyang

A linked bar chart is the augmentation of a traditional bar chart where each bar is partitioned into blocks and pairs of blocks are linked using orthogonal lines that pass over intermediate bars. The order of the blocks readily influences…

计算几何 · 计算机科学 2025-11-24 Steven van den Broek , Marc van Kreveld , Wouter Meulemans , Arjen Simons

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

群论 · 数学 2026-05-14 Joseph Paul MacManus

We propose a classification of group properties according to whether they can be deduced from the assumption that a group's subgroup lattice contains an interval isomorphic to some lattice. We are able to classify a few group properties as…

群论 · 数学 2014-04-08 William DeMeo

We completely determine all semigroup [epigroup] varieties that are cancellable elements of the lattice of all semigroup [respectively epigroup] varieties.

群论 · 数学 2019-03-22 V. Yu. Shaprynskii , D. V. Skokov , B. M. Vernikov

By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice $G$ form a…

环与代数 · 数学 2021-12-30 Gábor Czédli

We characterize sandwiched singularities in terms of their link in two different settings. We first prove that such singularities are precisely the normal surface singularities having self-similar non-archimedean links. We describe this…

代数几何 · 数学 2020-06-03 Lorenzo Fantini , Charles Favre , Matteo Ruggiero

For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set of any vertex is a q-valent tree. We also give conditions on a rooted digraph G which allow us to construct a countable…

组合数学 · 数学 2011-04-08 Daniela Amato , David M. Evans , John K. Truss

We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is \emph{shelling completable} if $\Delta$ can be realized as the initial sequence of some shelling of $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the…

组合数学 · 数学 2023-08-11 Michaela Coleman , Anton Dochtermann , Nathan Geist , Suho Oh

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

组合数学 · 数学 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

We call a lattice crosscut-simplicial if the crosscut complex of every atomic interval is equal to the boundary of a simplex. Every interval of such a lattice is either contractible or homotopy equivalent to a sphere. Recently, Hersh and…

组合数学 · 数学 2017-09-28 Thomas McConville

Recently, a class of solvable interaction round the face lattice models (IRF) were constructed for an arbitrary rational conformal field theory (RCFT) and an arbitrary field in it. The Boltzmann weights of the lattice models are related in…

高能物理 - 理论 · 物理学 2008-02-03 Doron Gepner

We give a notion of Scott rank for separable metric structures based on the definability of the (metric closures of) automorphism orbits in continuous infinitary logic. This is a continuous analogue of work of Montalb\'an for countable…

逻辑 · 数学 2024-11-05 Diego Bejarano