相关论文: The inverse rook problem on Ferrers boards

The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

The study of the topology of polynomial maps originates from classical questions in affine geometry, such as the Jacobian Conjecture, as well as from works of Whitney, Thom, and Mather in the 1950-70s on diffeomorphism types of smooth maps.…

We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…

We construct families of circles in the plane such that their tangency graphs have arbitrarily large girth and chromatic number. This provides a strong negative answer to Ringel's circle problem (1959). The proof relies on a…

Permutation polynomials (PPs) and their inverses have applications in cryptography, coding theory and combinatorial design theory. In this paper, we make a brief summary of the inverses of PPs of finite fields, and give the inverses of all…

Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…

The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

In this paper, we present a linear algebraic approach to the study of permutation polynomials that arise from linear maps over a finite field $\mathbb{F}_{q^2}$. We study a particular class of permutation polynomials over…

How can a stack of identical blocks be arranged to extend beyond the edge of a table as far as possible? We consider a generalization of this classic puzzle to blocks that differ in width and mass. Despite the seemingly simple premise, we…

We give a recursion for the multivariate Rogers-Szeg\"o polynomials, along with another recursive functional equation, and apply them to compute special values. We also consider the sum of all $q$-multinomial coefficients of some fixed…

The more then hundred years old Bernstein inequality states that the supremum norm of the derivative of a trigonometric polynomial of fixed degree can be bounded from above by supremum norm of the polynomial itself. The reversed Bernstein…

For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…

In these notes we investigate the rings of real polynomials in four variables, which are invariant under the action of the reflectiongroups [3,4,3] and [3,3,5]. It is well known that they are rationally generated in degree 2,6,8,12 and…

The interior polynomial was originally defined for hypergraphs and later shown to coincide with the Ehrhart polynomial of the root polytope of an associated bipartite graph. In previous work, we derived an alternating cycle recursion…

This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A polynomial time, combinatorial algorithm for the recoverable spanning tree problem is first constructed. This problem…

We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-deleted subgraphs, thus settling the ``polynomial reconstruction…

For a fixed root of a quiver, it is a very hard problem to construct all or even only one indecomposable representation with this root as dimension vector. We investigate two methods which can be used for this purpose. In both cases we get…