中文
相关论文

相关论文: Self-dual interval orders and row-Fishburn matrice…

200 篇论文

The connected components of $\mathcal{M}_{0,n}(\mathbb{R})$ are in bijection with the $(n-1)!/2$ dihedral orderings of $[n]$. They are all isomorphic. We construct monomial maps between them, and use these maps to prove a conjecture of…

组合数学 · 数学 2025-09-05 Veronica Calvo Cortes , Hannah Tillmann-Morris

We show that any order isomorphism between ordered structures of associative unital JB-subalgebras of JBW algebras is implemented naturally by a Jordan isomorphism. Consequently, JBW algebras are determined by the structure of their…

算子代数 · 数学 2011-12-01 J. Hamhalter , E. Turilova

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

逻辑 · 数学 2014-06-13 Lorenzo Luperi Baglini

Let $\mathscr{C}$ be an extriangulated category with enough projectives and injectives. We give a new definition of tilting subcategories of $\mathscr{C}$ and prove it coincides with the definition given in [19]. As applications, we…

表示论 · 数学 2024-09-13 Zhiwei Zhu , Jiaqun Wei

Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n|A]$ where $A$ is the adjacency matrix of a graph on $n$ vertices. A combinatorial interpretation of the minimum distance of such codes is given.…

组合数学 · 数学 2021-01-08 Sudipta Mallik , Bahattin Yildiz

A split preorder is a preordering relation on the disjoint union of two sets, which function as source and target when one composes split preorders. The paper presents by generators and equations the category SplPre, whose arrows are the…

范畴论 · 数学 2012-10-19 K. Dosen , Z. Petric

A T-net of order $m$ is a graph with $m$ nodes and $2m$ directed edges, where every node has indegree and outdegree equal to $2$. (A well known example of T-nets are de Bruijn graphs.) Given a T-net $N$ of order $m$, there is the so called…

组合数学 · 数学 2022-04-22 Josef Rukavicka

Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…

交换代数 · 数学 2021-11-08 Omar Leon Sanchez , Rahim Moosa

A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii)…

组合数学 · 数学 2007-05-23 David Callan

We give a novel combinatorial interpretation to the perturbative series solutions for a class of Dyson-Schwinger equations. We show how binary tubings of rooted trees with labels from an alphabet on the tubes, and where the labels satisfy…

数学物理 · 物理学 2025-09-16 Michael Borinsky , Gerald V. Dunne , Karen Yeats

The dynamical system generated by the iterated calculation of the high order gaps between neighboring terms of a sequence of natural numbers is remarkable and only incidentally characterized at the boundary by the notable Proth-Glibreath…

数论 · 数学 2024-12-11 Raghavendra N. Bhat , Cristian Cobeli , Alexandru Zaharescu

The {\sf Shi hyperplane arrangement} Shi(n) was introduced by Shi to study the Kazhdan-Lusztig cellular structure of the affine symmetric group. The {\sf Ish hyperplane arrangement} Ish(n) was introduced by Armstrong in the study of…

组合数学 · 数学 2013-07-25 Emily Leven , Brendon Rhoades , Andrew Timothy Wilson

The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that…

组合数学 · 数学 2014-06-12 Diana Avella-Alaminos , Ernesto Vallejo

Extending the notion of geometric bijections for regular matroids, introduced by the first and third author with Matthew Baker, we describe a family of bijections between bases of an oriented matroid and special orientations. These…

组合数学 · 数学 2026-04-07 Spencer Backman , Francisco Santos , Chi Ho Yuen

Two words $p$ and $q$ are avoided by the same number of length-$n$ words, for all $n$, precisely when $p$ and $q$ have the same set of border lengths. Previous proofs of this theorem use generating functions but do not provide an explicit…

组合数学 · 数学 2023-12-04 Julia Carrigan , Isaiah Hollars , Eric Rowland

We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first…

组合数学 · 数学 2024-06-24 Yen-Chi Roger Lin , Shu-Yen Pan

For a finite dimensional algebra $A$, we prove that the bounded homotopy category of projective $A$-modules and the bounded derived category of $A$-modules are dual to each other via certain categories of locally-finite cohomological…

环与代数 · 数学 2018-10-09 Xiao-Wu Chen

We define a birational map between labelings of a rectangular poset and its associated trapezoidal poset. This map tropicalizes to a bijection between the plane partitions of these posets of fixed height, giving a new bijective proof of a…

组合数学 · 数学 2023-11-14 Joseph Johnson , Ricky Ini Liu

We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

组合数学 · 数学 2020-11-20 Damir Yeliussizov

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