Related papers: Cauchy Transforms of Colored Graphs in Two Variabl…
We show that a finite coloring of an amenable group contains `many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and…
We consider the bimodal language, where the first modality is interpreted by a binary relation in the standard way, and the second is interpreted by the relation of inequality. It follows from Hughes (1990), that in this language,…
We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.
For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight 0.…
Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…
A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachromatic number of a graph is the greatest number of colors…
A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a…
We define and study rational discrete analytic functions and prove the existence of a coisometric realization for discrete analytic Schur multipliers.
We establish general versions of a variety of results for quasiconvex, lower-semicontinuous, and law-invariant functionals. Our results extend well-known results from the literature to a large class of spaces of random variables. We…
We study functions defined on a closed segment of the real line that belong to the class of Gonchar. We show that the graphs of such functions are pluripolar. We also discuss the generalizations of our result to functions defined on a…
We study the interplay between additivity (as in the Cauchy functional equation), subadditivity and linearity. We obtain automatic continuity results in which additive or subadditive functions, under minimal regularity conditions, are…
We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…
This work is dedicated to $\mathfrak{sl}_{n+1}$-related integrable stochastic vertex models; we call such models coloured. We prove several results about these models, which include the following: (1) We construct the basis of (rational)…
We study isospectrality for mixed Dirichlet-Neumann boundary conditions, and extend the previously derived graph-theoretic formulation of the transplantation method. Led by the theory of Brownian motion, we introduce vertex-colored and…
We derive an exact closed-form representation for the Euclidean thermal Green function of the two-dimensional (2D) free massless scalar field in coordinate space. This can be interpreted as the real part of a complex analytic function of a…
Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…
We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as…
The concept of a conformal deformation has two natural extensions: quasiconformal and harmonic mappings. Both classes do not preserve the conformal type of the domain, however they cannot change it in an arbitrary way. Doubly connected…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
We derive a functional relation between the generating functions of connected chord diagrams and 2-connected chord diagrams. This relation enables us to calculate an asymptotic expansion for the number of 2-connected chord diagrams on $n$…