English
Related papers

Related papers: On the interlace polynomials

200 papers

The interior polynomial of a directed graph is defined as the $h^*$-polynomial of the graph's (extended) root polytope, and it displays several attractive properties. Here we express its degree in terms of the minimum cardinality of a…

Combinatorics · Mathematics 2025-01-09 Tamás Kálmán , Lilla Tóthmérész

The generating function of the Bannai-Ito polynomials is derived using the fact that these polynomials are known to be essentially the Racah or $6j$ coefficients of the $\mathfrak{osp}(1|2)$ Lie superalgebra. The derivation is carried in a…

Mathematical Physics · Physics 2018-03-15 Geoffroy Bergeron , Luc Vinet , Satoshi Tsujimoto

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

Rings and Algebras · Mathematics 2012-02-20 Miguel Couceiro , Jean-Luc Marichal

In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some…

Combinatorics · Mathematics 2018-12-10 Somaya Barati , Beáta Bényi , Abbas Jafarzadeh , Daniel Yaqubi

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

Symbolic Computation · Computer Science 2023-06-12 Alin Bostan , Pierre Lairez , Bruno Salvy

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

Combinatorics · Mathematics 2007-05-23 Alexander Burstein , Sergey Kitaev , Toufik Mansour

It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

Group Theory · Mathematics 2016-06-16 Roland Bacher , Pierre De La Harpe

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

Combinatorics · Mathematics 2020-09-02 Reza Jafarpour-Golzari

The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the link. The Bollobas-Riordan-Tutte polynomial generalizes the…

Geometric Topology · Mathematics 2008-02-14 Oliver T. Dasbach , David Futer , Efstratia Kalfagianni , Xiao-Song Lin , Neal W. Stoltzfus

Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…

Combinatorics · Mathematics 2025-09-03 Zhiyun Cheng

The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…

Number Theory · Mathematics 2021-04-19 Yilmaz Simsek

Goulden and Jackson (1996) introduced, using Jack symmetric functions, some multivariate generating series $\psi(x, y, z; 1, 1+\beta)$ with an additional parameter $\beta$ that may be interpreted as a continuous deformation of the rooted…

Combinatorics · Mathematics 2017-08-14 Maciej Dołęga

Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…

Combinatorics · Mathematics 2010-05-18 I. V. Artamkin

The aim of this paper is to give a new approach to modified q-Bernstein polynomials for functions of two variables. By using these type polynomials, we derive recurrence formulas and some new interesting identities related to the second…

Number Theory · Mathematics 2013-12-06 Mehmet Acikgoz , Serkan Araci

An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…

Combinatorics · Mathematics 2021-08-17 Fumio Hazama

A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…

Optimization and Control · Mathematics 2026-02-13 Shravan Mohan

We provide a classification of all dynamical Lie algebras generated by 2-local spin interactions on undirected graphs. Building on our previous work where we provided such a classification for spin chains, here we consider the more general…

Quantum Physics · Physics 2024-10-01 Efekan Kökcü , Roeland Wiersema , Alexander F. Kemper , Bojko N. Bakalov

An exposition on Spivakovsky's dual graphs of valuations on function fields of dimension two is first given, leading to a proof of minimal generating sequences for the non-divisorial valuations. It should be noted that the definition of…

Commutative Algebra · Mathematics 2026-03-31 Charles Li

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

Discrete Mathematics · Computer Science 2015-12-31 Vivek S. Nittoor

We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…

Combinatorics · Mathematics 2011-05-16 Beifang Chen
‹ Prev 1 3 4 5 6 7 10 Next ›