中文
相关论文

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

200 篇论文

Double cosets appear in many contexts in combinatorics, for example in the enumeration of certain objects up to symmetries. Double cosets in a quotient of the form $H\backslash G / H$ have an inverse, and can be their own inverse. In this…

组合数学 · 数学 2025-06-05 Ludovic Schwob

The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with…

逻辑 · 数学 2009-09-25 Shmuel Lifsches , Saharon Shelah

In the first part of the paper kernels are constructed which meromorphically extend the Macdonald-Koornwinder polynomials in their degrees. In the second part of the paper the kernels associated with rank one root systems are used to define…

量子代数 · 数学 2007-05-23 Jasper V. Stokman

Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees.…

离散数学 · 计算机科学 2022-05-13 Florian Ingels , Romain Azaïs

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with…

组合数学 · 数学 2015-04-24 E. Ghorbani , A. Mohammadian , B. Tayfeh-Rezaie

Let $T$ be a tree on $n$ vertices. We can regard the edges of $T$ as transpositions of the vertex set; their product (in any order) is a cyclic permutation. All possible cyclic permutations arise (each exactly once) if and only if the tree…

组合数学 · 数学 2020-10-29 Peter J. Cameron , Liam Stott

The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…

组合数学 · 数学 2023-06-09 Giulio Cerbai , Anders Claesson

We prove that the structure of right generalized inverse semigroups is determined by free \'etale actions of inverse semigroups. This leads to a tensor product interpretation of Yamada's classical struture theorem for generalized inverse…

范畴论 · 数学 2012-07-19 Ganna Kudryavtseva , Mark V. Lawson

We define and study a series indexed by rooted trees and with coefficients in Q(q). We show that it is related to a family of Lie idempotents. We prove that this series is a q-deformation of a more classical series and that some of its…

量子代数 · 数学 2008-07-14 Frédéric Chapoton

The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…

数论 · 数学 2025-01-20 Stefan Ehbauer , Aleksandr Grishkov , Dmitry Logachev

We take the first step toward a structure theory that includes both operations of a ring $\mathcal{R}$. More precisely, we prove a series of inverse results for the structure of sets $A\subseteq \mathbf{F}_p$ such that, under certain…

组合数学 · 数学 2026-01-21 Aliaksei Semchankau , Ilya Shkredov

An element $g$ of a group is called {\em reversible} if it is conjugate in the group to its inverse. This paper is about reversibles in the group $G$ of formally-invertible pairs of formal power series in two variables, with complex…

复变函数 · 数学 2022-03-22 Anthony G. O'Farrell , Dmitri Zaitsev

Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with…

组合数学 · 数学 2012-10-29 Hein van der Holst

In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…

组合数学 · 数学 2008-09-16 Patricia Hersh

We consider chaining multiplicative-inverse operations in finite fields under alternating polynomial bases. When using two distinct polynomial bases to alternate the inverse operation we obtain a partition of $\mathbb F_{p^n}\setminus…

数论 · 数学 2025-07-31 Divyarthi Mohan , R. Ravindraraj

We study second-order modular differential equations whose solutions transform equivariantly under the modular group. In the reducible case, we construct all such solutions using an explicit ansatz involving Eisenstein series and the…

数论 · 数学 2025-08-15 Khalil Besrour , Hicham Saber , Abdellah Sebbar

We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher…

组合数学 · 数学 2016-01-20 Stephan Wagner

We consider so-called simple families of labelled trees, which contain, e.g., ordered, unordered, binary and cyclic labelled trees as special instances, and study the global and local behaviour of the number of inversions. In particular we…

组合数学 · 数学 2011-01-26 Alois Panholzer , Georg Seitz

Let $R$ be a unital ring with involution. We give several characterizations and properties of core partial order in $R$. In particular, we investigate the reverse order law $(ab)^{\tiny\textcircled{\tiny\#}} = b^{\tiny\textcircled{\tiny\#}}…

环与代数 · 数学 2017-05-26 Xiaoxiang Zhang , Sanzhang Xu , Jianlong Chen

Let $X$ be an arbitrary poset and $K$ an arbitrary field. We describe linear unital invertibility preservers of the finitary incidence algebra $FI(X,K)$ in terms of certain maps of the power set algebra $\mathcal{P}(X)$ and linear maps…

环与代数 · 数学 2024-04-15 Jorge J. Garcés , Mykola Khrypchenko