Related papers: A Combinatorial Method for Computing Characteristi…
We introduce the characteristic numbers and the chromatic polynomial of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of quadrics in Schubert calculus, Betti…
We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently this technique…
We present a Poisson formula for sparse resultants and a formula for the product of the roots of a family of Laurent polynomials, which are valid for arbitrary families of supports. To obtain these formulae, we show that the sparse…
We use the characteristic polynomial of the Coxeter matrix of an algebra to complete the combinatorial classification of piecewise hereditary algebras which Happel gave in terms of the trace of the Coxeter matrix. We also give a…
In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
We consider matrices of the form $qD+A$, with $D$ being the diagonal matrix of degrees, $A$ being the adjacency matrix, and $q$ a fixed value. Given a graph $H$ and $B\subseteq V(G)$, which we call a coalescent pair $(H,B)$, we derive a…
We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
We introduce new types of local algorithms, which we call "ASI Algorithms", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to unify arguments from the two fields, and also sometimes to…
In the case of two combinatorial polynomials, we show that they can exhibited as moments of paramaterized families of orthogonal polynomials, and hence derive their Hankel transforms. Exponential Riordan arrays are the main vehicles used…
We derive formulas for characterizing bounded orthogonally additive polynomials in two ways. Firstly, we prove that certain formulas for orthogonally additive polynomials derived in \cite{Kusa} actually characterize them. Secondly, by…
We show how combinatorial star products can be used to obtain strict deformation quantizations of polynomial Poisson structures on $\mathbb R^d$, generalizing known results for constant and linear Poisson structures to polynomial Poisson…
We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several graph invariants.
The joint moments of the derivatives of the characteristic polynomial of a random unitary matrix, and also a variant of the characteristic polynomial that is real on the unit circle, in the large matrix size limit, have been studied…
We present a decomposition of the generalized binomial coefficients associated with Jack polynomials into two factors: a stem, which is described explicitly in terms of hooks of the indexing partitions, and a leaf, which inherits various…
We give some formulas of the James-Hopf maps by using combinatorial methods. An application is to give a product decomposition of the spaces $\Omega\Sigma^2(X)$.
In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…
We compare eight versions of finite-dimensional categorifications of the colored Jones polynomial and show that they yield isomorphic results over a field of characteristic zero. As an application, we verify a physics-motivated conjectural…