中文
相关论文

相关论文: Tamari lattices and noncrossing partitions in type…

200 篇论文

By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…

组合数学 · 数学 2026-03-19 Leen Aburub , Gergo Gyenizse

An arrangement of s elements in s rows and s columns, such that no element repeats more than once in each row and each column is called a Latin square of order s. If two Latin squares of the same order superimposed one on the other and in…

离散数学 · 计算机科学 2011-11-09 R. N. Mohan , Moon Ho Lee , Subash Pokreal

Given a lattice path $\nu$, the $\nu$-Tamari lattice and the $\nu$-Dyck lattice are two natural examples of partial order structures on the set of lattice paths that lie weakly above $\nu$. In this paper, we introduce a more general family…

组合数学 · 数学 2025-04-16 Cesar Ceballos , Clément Chenevière

Martingale-like sequences in vector lattice and Banach lattice frameworks are defined in the same way as martingales are defined in [Positivity 9 (2005), 437--456]. In these frameworks, a collection of bounded $X$-martingales is shown to be…

概率论 · 数学 2019-02-05 Haile Gessesse , Alexander Melnikov

Let $T(n,m)$ be the set of all plane labelled bipartite trees with $n$ white vertices and $m$ black. If the number $n+m$ of vertices is even, then the set $T(n,m)$ is a union of two disjoint subsets --- subset od "even" trees and subset of…

组合数学 · 数学 2016-11-04 Yury Kochetkov

Wilcox has considered a twisted semigroup algebra structure on the partition algebra $\mathbb{C}A_k(n)$, but it appears that there has not previously been any known basis that gives $\mathbb{C}A_k(n)$ the structure of a "non-twisted"…

组合数学 · 数学 2025-07-22 John M. Campbell

We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…

组合数学 · 数学 2014-01-29 Qingchun Ren

We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…

组合数学 · 数学 2007-05-23 Rekha Natarajan

In this paper we investigate a family of matroids introduced by Ardila and Billey to study one-dimensional intersections of complete flag arrangements of $\mathbb{C}^n$. The set of lattice points $P_n$ inside the equilateral triangle $S_n$…

组合数学 · 数学 2018-11-20 Felix Gotti , Harold Polo

We describe triangle coordinates for integral laminations on a non-orientable surface $N_{k,n}$ of genus $k$ with $n$ punctures and one boundary component, and give an explicit bijection from the set of integral laminations on $N_{k,n}$ to…

几何拓扑 · 数学 2017-03-13 S. Öykü Yurttaş , Mehmetcik Pamuk

An N -tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC . We wish to…

度量几何 · 数学 2012-06-12 Michael Beeson

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

组合数学 · 数学 2020-07-21 Stefan Felsner , Clemens Huemer , Sarah Kappes , David Orden

This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…

逻辑 · 数学 2021-05-18 Ivan Chajda , Helmut Länger

We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T, T'] where T and T' are balanced binary trees are isomorphic as posets to a hypercube. We introduce synchronous…

组合数学 · 数学 2012-04-24 Samuele Giraudo

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

度量几何 · 数学 2007-06-13 George M. Bergman

I present an overview of the research I have conducted for the past ten years in algebraic, bijective, enumerative, and geometric combinatorics. The two main objects I have studied are the permutahedron and the associahedron as well as the…

组合数学 · 数学 2023-10-20 Viviane Pons

Orbital semilattices are introduced as bounded semilattices that are, in addition, equipped with an outer multiplication (a semigroup action) and diagonals (a concept borrowed from cylindric algebra), where each semilattice element has a…

综合数学 · 数学 2022-06-17 Jens Kötters , Stefan E. Schmidt

The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path…

In this article we introduce the $m$-cover poset of an arbitrary bounded poset $\mathcal{P}$, which is a certain subposet of the $m$-fold direct product of $\mathcal{P}$ with itself. Its ground set consists of multichains of $\mathcal{P}$…

组合数学 · 数学 2016-07-27 Myrto Kallipoliti , Henri Mühle

Ceballos and Pons generalized weak order on permutations to a partial order on certain labeled trees, thereby introducing a new class of lattices called $s$-weak order. They also generalized the Tamari lattice by defining a particular…

组合数学 · 数学 2020-09-08 Stephen Lacina