Related papers: Seven combinatorial problems around quasihomogeneo…

We work with small non-selfadjoint perturbations of a selfadjoint quantum Hamiltonian with two degrees of freedom, assuming that the principal symbol of the selfadjoint part is (classically) a nearly integrable system, together with a…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

We give a criterion for the existence of a non-degenerate quasihomogeneous polynomial in a configuration, i.e. in the space of polynomials with a fixed set of weights, and clarify the relation of this criterion to the necessary condition…

As we go along with a bioinformatic analysis we stumbled over a new combinatorial question. Although the problem is a very special one, there are maybe more applications than only this one we have. This text is mainly about the general…

We present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1,x2,....]. First, we prove a "splitting" rule for the basis of key polynomials [Demazure '74], thereby establishing a new positivity theorem…

Kazhdan-Lusztig polynomials are important and mysterious objects in representation theory. Here we present a new formula for their computation for symmetric groups based on the Bruhat graph. Our approach suggests a solution to the…

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…

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…

In this paper we study quasi-orthogonality on the unit circle based on the structural and orthogonal properties of a class of self-invariant polynomials. We discuss a special case in which these polynomials are represented in terms of the…

In this paper, we pose many challenging conjectures on congruences involving binomial coefficients and Ap\'ery-like numbers.

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

According to the classification of quasihomogeneus singularities, any polynomial $f$ defining such singularity has a decomposition $f = f_\kappa + f_{add}$. The polynomial $f_\kappa$ is of the certain form while $f_{add}$ is only restricted…

In this paper, we introduce an equivariant version of the characteristic quasi-polynomials as the permutation characters on the complement of mod $q$ hyperplane arrangements. We prove that the permutation character is a quasi-polynomial in…

We describe combinatorial aspects of classical resolution of singularities that are free of characteristic and can be applied to singular foliations and vector fields as well as to functions and varieties. In particular, we give a…

The purpose of this paper is twofold. Firstly, we generalize the notion of characteristic polynomials of hyperplane and toric arrangements to those of certain abelian Lie group arrangements. Secondly, we give two interpretations for the…

In this work, we propose a new existence result for quasi-equilibrium problems using generalized monotonicity in an infinite dimensional space. Also, we show that the notions of generalized monotonicity can be characterized in terms of…

Thom polynomials are universal cohomological obstructions to the appearance of singularities of given types in differentiable maps. As an application, various invariants of immersions have been expressed in terms of singularities of their…

Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…