Related papers: Parking Functions on Directed Graphs and Some Dire…
In 1966, Konheim and Weiss [33] introduced a now classical parking protocol. The deterministic process and its resultant objects, known as parking functions, have since become a favorite object of study in enumerative combinatorics. In our…
In this paper, we mainly study two notions of pattern avoidance in parking functions. First, for any collection of length 3 patterns, we compute the number of parking functions of size $n$ that avoid them under the first notion. This is…
Graph neural networks (GNNs) are typically applied to static graphs that are assumed to be known upfront. This static input structure is often informed purely by insight of the machine learning practitioner, and might not be optimal for the…
We adapt the study of hyperspaces and function spaces from classical topology to digital topology. We define digital hyperspaces and digital function graphs, and study some of their relationships and graphical properties.
We present projective descriptions of classical spaces of functions and distributions. More precisely, we provide descriptions of these spaces by semi-norms which are defined by a combination of classical norms and multiplication or…
The classical perspective of a function is a construction which transforms a convex function into one that is jointly convex with respect to an auxiliary scaling variable. Motivated by applications in several areas of applied analysis, we…
This paper investigates the feasibility of using Graph Neural Networks (GNNs) for classical motion planning problems. We propose guiding both continuous and discrete planning algorithms using GNNs' ability to robustly encode the topology of…
We show that a minimal triangulation of the associahedron (Stasheff polytope) of dimension n is made of (n+1)^{n-1} simplices. We construct a natural bijection with the set of parking functions from a new interpretation of parking functions…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
It is known that there exists a function interpolating a given data set such that the graph of the function is the attractor of an iterated function system which is called fractal interpolation function. We generalize the notion of fractal…
A ridge function is a function of several variables that is constant along certain directions in its domain. Using classical dimensional analysis, we show that many physical laws are ridge functions; this fact yields insight into the…
We describe dynamical properties of a map $\mathfrak{F}$ defined on the space of rational functions. The fixed points of $\mathfrak{F}$ are classified and the long time behavior of a subclass is described in terms of Eulerian polynomials.
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…
In this paper, we introduce directed networks called `divergence network' in order to perform graphical calculation of divergence functions. By using the divergence networks, we can easily understand the geometric meaning of calculation…
In this paper, we consider the problem of reconstructing a directed graph using path queries. In this query model of learning, a graph is hidden from the learner, and the learner can access information about it with path queries. For a…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
In this article we describe a program -- called planar_draw -- to draw maps on oriented surfaces in the plane. The drawings are coded as tikz files that can easily be manipulated and used in latex documents. Next to plane maps -- a case for…
In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we…
We expand the notion of a normal function for a Hodge class on an even-dimensional complex projective manifold to the notion of a 'topological normal function' associated to any primitive integral cohomology class. The definition of the…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…