Related papers: Compositional Bernoulli numbers
We express classical, free, Boolean and monotone cumulants in terms of each other, using combinatorics of heaps, pyramids, Tutte polynomials and permutations. We completely determine the coefficients of these formulas with the exception of…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
Compositional generalization is the capacity to recognize and imagine a large amount of novel combinations from known components. It is a key in human intelligence, but current neural networks generally lack such ability. This report…
In this paper we study properties of numbers $K_n^l$ of connected components of bifurcation diagrams for multiboundary singularities $B_n^l$. These numbers generalize classic Bernoulli-Euler numbers. We prove a recurrent relation on the…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
We define unimodular measures on the space of rooted simplicial complexes and associate to each measure a chain complex and a trace function. As a consequence, we can define $\ell^2$-Betti numbers of unimodular random rooted simplicial…
As is well-known, poly-Bernoulli polynomials are defined in terms of polylogarithm functions. Recently, as degenerate version of such functions and polynomials, degenerate polylogarithm functions were introduced and degenertae…
Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in simple situations. This paper concerns binary radix systems, i.e., positional number systems with digits…
We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear…
For any integer $k$, M.Kaneko defined $k$-th poly-Bernoulli numbers as a kind of generalization of classical Bernoulli numbers using $k$-th polylogarithm. In case when $k$ is positive, $k$-th poly-Bernoulli numbers is a sequence of rational…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
Condition numbers of random polynomial systems have been widely studied in the literature under certain coefficient ensembles of invariant type. In this note we introduce a method that allows us to study these numbers for a broad family of…
Combinatorial properties of maximal repetitions (runs) in formal words are studied. We classify all maximal repetitions in a word as primary and secondary where the set of all primary repetitions determines all the other repetitons in the…
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…
We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…
We define a $q$-deformation of the classical ring of integer-valued polynomials which we call the ring of quantum integer-valued polynomials. We show that this ring has a remarkable combinatorial structure and enjoys many positivity…
We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…