中文
相关论文

相关论文: On a rank-unimodality conjecture of Morier-Genoud …

200 篇论文

We consider profunctors $f : P \promap Q$ between posets and introduce their {\em graph} and {\em ascent}. The profunctors $\Pro(P,Q)$ form themselves a poset, and we consider a partition $\cI \sqcup \cF$ of this into a down-set $\cI$ and…

组合数学 · 数学 2023-02-21 Gunnar Fløystad

A new result of G. Cz\'edli states that for an ordered set $P$ with at least two elements and a group $G$, there exists a bounded lattice $L$ such that the ordered set of principal congruences of $L$ is isomorphic to $P$ and the…

环与代数 · 数学 2022-08-04 G. Grätzer

In this paper we introduce and study the poset of equivalence classes of subgroups of a finite group $G$, induced by the isomorphism relation. This contains the well-known lattice of solitary subgroups of $G$. We prove that in several…

群论 · 数学 2015-02-18 Marius Tarnauceanu

We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattices with operators'. Specifically, we introduce a very…

逻辑 · 数学 2016-04-05 Willem Conradie , Alessandra Palmigiano

We introduce and develop the theory of UMEL-shellable posets. These are posets equipped with an edge-lexicographical labeling satisfying certain uniformity and monotonicity properties. This framework encompasses classical families of…

组合数学 · 数学 2025-12-22 Basile Coron , Luis Ferroni , Shiyue Li

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…

逻辑 · 数学 2008-07-22 Luigi Santocanale

The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…

组合数学 · 数学 2015-11-11 Christos A. Athanasiadis , Myrto Kallipoliti

Let $G$ be a higher rank semisimple real Lie group or the product of at least two automorphism groups of regular trees. We prove all probability measure preserving actions of lattices in such groups have cost one, answering Gaboriau's fixed…

几何拓扑 · 数学 2023-07-04 Mikolaj Fraczyk , Sam Mellick , Amanda Wilkens

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…

范畴论 · 数学 2011-05-11 Pierre Gillibert , Friedrich Wehrung

We introduce a family of toric algebras defined by maximal chains of a finite distributive lattice. Applying results on stable set polytopes we conclude that every such algebra is normal and Cohen-Macaulay, and give an interpretation of its…

交换代数 · 数学 2024-03-13 Oleksandra Gasanova , Lisa Nicklasson

Suppose $\mathbb{F}$ is a field and let $\mathbf{a} := (a_1, a_2, \dotsc)$ be a sequence of non-zero elements in $\mathbb{F}$. For $\mathbf{a}_n := (a_1, \dotsc, a_n)$, we consider the family $\mathcal{M}_n(\mathbf{a})$ of $n \times n$…

A new class of partial order-types, class $\gbqo^+$ is defined and investigated here. A poset $P$ is in the class $W^+ $ iff the free poset algebra $F(P)$ is generated by a better quasi-order $G$ that is included in the free lattice $L(P)$.…

一般拓扑 · 数学 2012-10-23 Uri Abraham , Robert Bonnet , Wieslaw Kubis

It is shown that the numbers $c_i$ of chains of length $i$ in the proper part $L\setminus\{0,1\}$ of a distributive lattice $L$ of length $\ell +2$ satisfy the inequalities $$c_0<...<c_{\lfloor{\ell /2}\rfloor} \quad{and}\quad c_{\lfloor{3…

组合数学 · 数学 2007-05-23 Anders Björner , Jonathan David Farley

In this paper we study structural properties of residuated lattices that are idempotent as monoids. We provide descriptions of the totally ordered members of this class and obtain counting theorems for the number of finite algebras in…

逻辑 · 数学 2020-04-22 José Gil-Férez , Peter Jipsen , George Metcalfe

The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…

环与代数 · 数学 2014-02-03 Primož Škraba , João Pita Costa

We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…

计算机科学中的逻辑 · 计算机科学 2025-11-24 Benjamin Przybocki , Guilherme V. Toledo , Yoni Zohar

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

形式语言与自动机理论 · 计算机科学 2011-11-03 Michał Skrzypczak

We prove a representation theorem for totally ordered idempotent monoids via a nested sum construction. Using this representation theorem we obtain a characterization of the subdirectly irreducible members of the variety of semilinear…

环与代数 · 数学 2026-02-16 Simon Santschi

We describe in this note a torsor structure arising on the affine scheme defined by a system of rationnal algebraic relations between polyzetas at roots of unity (values of hyperlogarithmic functions on a fixed finite group of complex roots…

量子代数 · 数学 2007-05-23 Georges Racinet

We characterize the Archimedean lattice-ordered algebras with identity that admit a polynomial growth continuous function calculus. More precisely, for an $n$-tuple $\mathbf{x}=(x_1,\dots,x_n)$ in an Archimedean lattice-ordered algebra $X$…

泛函分析 · 数学 2026-04-23 David Muñoz-Lahoz