中文
相关论文

相关论文: Identities in plactic, hypoplactic, sylvester, Bax…

200 篇论文

We establish a criterion for a semigroup identity to hold in the monoid of $n \times n$ upper unitriangular matrices with entries in a commutative semiring $S$. This criterion is combinatorial modulo the arithmetic of the multiplicative…

环与代数 · 数学 2018-05-01 Marianne Johnson , Peter Fenner

We present a simple alternative viewpoint on Hodge-Newton indecomposability, illustrating its explanatory value through a uniform proof of a combinatorial identity arising from affine Deligne-Lusztig varieties with finite Coxeter part.

数论 · 数学 2026-03-10 Dong Gyu Lim

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…

We investigate a class of topological monoids with a suitable family of characters which we call Feller topological monoids. We extend the classical notion of subordinators to subordinators on Feller topological monoids. Under suitable…

概率论 · 数学 2022-10-25 Ulises Pérez Cendejas , Gerardo Pérez Suárez

We classify and enumerate the idempotents in several planar diagram monoids: namely, the Motzkin, Jones (a.k.a. Temperley-Lieb) and Kauffman monoids. The classification is in terms of certain vertex- and edge-coloured graphs associated to…

Dendriform structures arise naturally in algebraic combinatorics (where they allow, for example, the splitting of the shuffle product into two pieces) and through Rota-Baxter algebra structures (the latter appear, among others, in…

组合数学 · 数学 2021-02-01 Kurusch Ebrahimi-Fard , Dominique Manchon , Frédéric Patras

We consider the characterizations of positive definite as well as nonnegative definite quadratic forms in terms of the principal minors of the associated symmetric matrix. We briefly review some of the known proofs, including a classical…

历史与综述 · 数学 2008-08-17 Sudhir R. Ghorpade , Balmohan V. Limaye

The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids…

计算机科学中的逻辑 · 计算机科学 2015-06-17 Jiri Adamek , Stefan Milius , Henning Urbat

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

In the process of studying a conjecture of Holly M. Green and Martin W. Liebeck, we obtain two interesting identities by elementary methods, one is a combinatorial identity, and the other is a number theoretic identity.

综合数学 · 数学 2021-04-22 Junyao Pan

We use Kashiwara's theory of crystal bases to study the plactic monoid for type C. Then we describe the correponding sliding and bumping algorithms.

组合数学 · 数学 2007-05-23 Cedric Lecouvey

Sylvester's identity is a classical determinantal identity with a straightforward linear algebra proof. We present a new, combinatorial proof of the identity, prove several non-commutative versions, and find a $\beta$-extension that is both…

组合数学 · 数学 2007-05-23 Matjaz Konvalinka

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

组合数学 · 数学 2024-03-07 Kevin Purbhoo

In this note, we present two new identities for derangements. As a corollary, we have a combinatorial proof of the irreducibility of the standard representation of symmetric groups.

组合数学 · 数学 2007-05-23 Le Anh Vinh

We consider the stable matching problem when the preference lists are not given explicitly but are represented in a succinct way and ask whether the problem becomes computationally easier and investigate other implications. We give…

数据结构与算法 · 计算机科学 2016-12-21 Marvin Künnemann , Daniel Moeller , Ramamohan Paturi , Stefan Schneider

Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…

群论 · 数学 2025-09-30 Islam Foniqi , Robert D. Gray

We study sets of univariate hyperbolic polynomials that share the same first few coefficients and show that they have a natural combinatorial description akin to that of polytopes. We define a stratification of such sets in terms of root…

代数几何 · 数学 2023-07-10 Arne Lien

We study mixed identities for oligomorphic automorphism groups of countable relational structures. Our main result gives sufficient conditions for such a group to not admit a mixed identity without particular constants. We study numerous…

群论 · 数学 2025-08-20 Manuel Bodirsky , Jakob Schneider , Andreas Thom

We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…

组合数学 · 数学 2009-09-15 Joseph P. S. Kung

We give a complete classification of all nonuniform congruences on orthogonal rook monoids and symplectic rook monoids. We find that there are four kinds of nonuniform congruences on the orthogonal rook monoids ${OR}_n$ for even $n\ne 4$,…

群论 · 数学 2019-06-10 Jianqiang Feng , Zhenheng Li