中文
相关论文

相关论文: Inversion of integral series enumerating planar tr…

200 篇论文

We give an algebraic characterisation of ordered groupoids, namely, we show that there is a categorical isomophism between the category of ordered groupoids and the category of $D$-inverse constellations. Here constellations are partial…

范畴论 · 数学 2025-08-28 Victoria Gould , Tim Stokes

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…

组合数学 · 数学 2013-02-12 Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…

组合数学 · 数学 2007-05-23 Richard P. Stanley

A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…

逻辑 · 数学 2017-11-07 Miloš S. Kurilić , Nenad Morača

The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Thomas Colcombet

For a given symmetric quiver $Q$, we define a supercommutative quadratic algebra $\mathcal{A}_Q$ whose Poincar\'e series is related to the motivic generating function of $Q$ by a simple change of variables. The Koszul duality between…

表示论 · 数学 2022-11-09 Vladimir Dotsenko , Evgeny Feigin , Markus Reineke

A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…

组合数学 · 数学 2020-02-12 Robert Jajcay , Tatiana Jajcayova , Nóra Szakács , Mária B. Szendrei

This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the…

组合数学 · 数学 2009-06-02 Miklos Bona , Meera Sitharam , Andrew Vince

The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…

定量方法 · 定量生物学 2012-04-24 J G Sumner , P D Jarvis

In this paper, we discuss the inverse problem of determining a semisimple group algebra from the knowledge of rings of the type sum_{t=1}^s M_{n_t}(Ft), where j is an arbitrary integer and F_t is finite field for each t, and show that it is…

环与代数 · 数学 2019-11-19 Gaurav Mittal

Two doubly indexed families of polynomials in several indeterminates are considered. They are related to the falling and rising factorials in a similar way as the potential polynomials (introduced by L. Comtet) are related to the ordinary…

组合数学 · 数学 2023-12-12 Alfred Schreiber

An algebraic tree T is one determined by a finite system of fixed point equations. The frontier \Fr(T) of an algebraic tree t is linearly ordered by the lexicographic order \lex. When (\Fr(T),\lex) is well-ordered, its order type is an…

形式语言与自动机理论 · 计算机科学 2010-02-08 S. L. Bloom , Z. Esik

In this article, we investigate the existence of joins in the weak order of an infinite Coxeter group W. We give a geometric characterization of the existence of a join for a subset X in W in terms of the inversion sets of its elements and…

群论 · 数学 2016-05-10 Christophe Hohlweg , Jean-Philippe Labbé

We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…

谱理论 · 数学 2022-03-31 Tanay Wakhare , Charles R. Johnson

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

组合数学 · 数学 2018-07-24 Ghodratollah Aalipour , Art M. Duval , Woong Kook , Kang-Ju Lee , Jeremy L. Martin

We introduce a functor ${\sf As}$ from the category of posets to the category of nonsymmetric binary and quadratic operads, establishing a new connection between these two categories. Each operad obtained by the construction ${\sf As}$…

组合数学 · 数学 2016-04-06 Samuele Giraudo

Bjoerner and Wachs provided two q-generalizations of Knuth's hook formula counting linear extensions of forests: one involving the major index statistic, and one involving the inversion number statistic. We prove a multivariate…

组合数学 · 数学 2011-07-19 Florent Hivert , Victor Reiner

Let W be a Coxeter group. We show that a certain power series involving a sum over all involutions in W can be expressed in terms of the Poincare series of W. (The case where W is finite is already known,)

表示论 · 数学 2014-11-17 G. Lusztig

We study the rational Kontsevich integral of torus knots. We construct explicitely a series of diagrams made of circles joined together in a tree-like fashion and colored by some special rational functions. We show that this series codes…

几何拓扑 · 数学 2014-10-01 Julien Marche

An inversive meadow is a commutative ring with identity equipped with a multiplicative inverse operation made total by choosing 0 as its value at 0. Previously, inversive meadows were shortly called meadows. A divisive meadow is an…

环与代数 · 数学 2010-11-03 J. A. Bergstra , C. A. Middelburg