Related papers: (G,m)-multiparking functions
In this work, generalized hypergeometric functions for bicomplex argument is introduced and its convergence criteria is derived. Furthermore, integral representation of this function has been established. Moreover, quadratic transformation,…
Stanley [9] introduced the chromatic symmetric function ${\bf X}_G$ associated to a simple graph $G$ as a generalization of the chromatic polynomial of $G$. In this paper we present a novel technique to write ${\bf X}_G$ as a linear…
In two-dimensional statistical physics, correlation functions of the O(N) and Potts models may be written as sums over configurations of non-intersecting loops. We define sums associated to a large class of combinatorial maps (also known as…
In this paper relations of non-empty intersection, inclusion end equality of domains of functions for $(2,n)$-semigroups of partial $n$-place functions are investigated.
In this paper, we extend the chromatic symmetric function $X$ to a chromatic $k$-multisymmetric function $X_k$, defined for graphs equipped with a partition of their vertex set into $k$ parts. We demonstrate that this new function retains…
For a graph $G$ on $v(G)$ vertices let $m_k(G)$ denote the number of matchings of size $k$, and consider the partition function $M_{G}(\lambda)=\sum_{k=0}^nm_k(G)\lambda^k$. In this paper we show that if $G$ is a $d$--regular graph and…
Unit-interval parking functions are subset of parking functions in which cars park at most one spot away from their preferred parking spot. In this paper, we characterize unit-interval parking functions by understanding how they decompose…
A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representations. However, how the richness of such interactions trades off…
Functional Gaussian graphical models (GGM) used for analyzing multivariate functional data customarily estimate an unknown graphical model representing the conditional relationships between the functional variables. However, in many…
We answer an open problem of arXiv:1204.1760 and arXiv:1205.4293, extending their work to irreducible well--generated complex reflection groups $W$. We define a combinatorial $W$-noncrossing parking space and an algebraic $W$-parking space…
In this paper, we introduce a connection between two classical concepts of graph theory: \; metric dimension and distinguishing number. For a given graph $G$, let ${\rm dim}(G)$ and $D(G)$ represent its metric dimension and distinguishing…
We introduce type C parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type C parking functions to regions of the Shi arrangement of type C, encoded as diagonally…
The output of a machine learning algorithm can usually be represented by one or more multivariate functions of its input variables. Knowing the global properties of such functions can help in understanding the system that produced the data…
Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…
DP-coloring is a generalization of list coloring that was introduced in 2015 by Dvo\v{r}\'{a}k and Postle. The chromatic polynomial of a graph is a notion that has been extensively studied since the early 20th century. The chromatic…
A complete characterization of two functions $f(x,y)$ and $g(x,y)$ in the $(f,g)$-inversion is presented. As an application to the theory of hypergeometric series, a general bibasic summation formula determined by $f(x,y)$ and $g(x,y)$ as…
We define covering and separation numbers for functions. We investigate their properties, and show that for some classes of functions there is exact equality of separation and covering. We provide analogues for various geometric…
The basic mathematical properties of Green's functions used in statistical mechanics as well as the equations defining these functions and the techniques of solving these equations are reviewed. An approach is presented called the…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose arcs are each assigned one of $n$ colours. A \emph{switch}…