Related papers: Polynomial functions on Young diagrams arising fro…
We consider the problem of finding a Young diagram minimizing the sum of evaluations of a given pair of functions on the parts of the associated pair of conjugate partitions. While there are exponentially many diagrams, we show it is…
We determine the most general form of a smooth function on Young diagrams, that is, a polynomial in the interlacing or multirectangular coordinates whose value depends only on the shape of the diagram. We prove that the algebra of such…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial $p \in \mathbb{N}[x]$, and any directed finite bipartite graph can be considered as a polynomial $p\in\mathbb{N}[x,y]$, and vise…
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on…
Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
The series of papers is devoted to the study of convergence for pairs of surfaces and smooth functions thereon. We model such pairs with varifolds and multiple-valued functions to capture their limits. In the present paper, we study Young…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
There are several examples of spaces of univariate functions for which we have a characterization of all sets of knots which are poised for the interpolation problem. For the standard spaces of univariate polynomials, or spline functions…
Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…
We present a unified framework of combinatorial descriptions, and the analogous asymptotic growth of the coefficients of two general families of functions related to integer partitions. In particular, we resolve several conjectures and…
In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…