相关论文: Additive induced-hereditary properties and unique …

Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…

Incidence-based generalizations of cycle covers, called contributors, extend the Harary-Sachs coefficient theorem for characteristic polynomials of the adjacency matrix of graphs. All minors of the Laplacian resulting from an integer matrix…

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

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…

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

Erd\H{o}s and Hajnal proved that every graph of uncountable chromatic number contains arbitrarily large finite, complete, bipartite graphs. We extend this result to hypergraphs.

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation…

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 that a tensor product of irreducible, finite dimensional representations of a simple Lie algebra over a field of characteristic zero, determines the individual constituents uniquely. This is analogous to the uniqueness of prime…

A fundamental connection between list vertex colourings of graphs and Property B (also known as hypergraph 2-colourability) was already known to Erd\H{o}s, Rubin and Taylor. In this article, we draw similar connections for improper list…

We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…

Consider a graph whose vertices are colored in one of two colors, say black or white. A white vertex is called integrated if it has at least as many black neighbors as white neighbors, and similarly for a black vertex. The coloring as a…

For a fixed graph $H$ on $k$ vertices, and a graph $G$ on at least $k$ vertices, we write $G\rightarrow H$ if in any vertex-coloring of $G$ with $k$ colors, there is an induced subgraph isomorphic to $H$ whose vertices have distinct colors.…

In our previous works (2012, 2013), we provided a finite list of properties characterizing all potential types of quadratic birational transformations of a projective space into a factorial variety, whose base locus is smooth and…

We study Extremal Combinatorics problems where local properties are used to derive global properties. That is, we consider a given configuration where every small piece of the configuration satisfies some restriction, and use this local…

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…