Related papers: Periodic Parallelogram Polyominoes
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional bivalent vertices in one model but not in the other. In the…
When all the elements of the multiset $\{1,1,2,2,3,3,\ldots,k,k\}$ are placed in the cells of a $2\times k$ rectangular array, in how many configurations are exactly $v$ of the pairs directly over top one another, and exactly $h$ directly…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
The method of constructing spline classes in the form of trigonometric Fourier series whose coefficients have a certain decreasing order are considered. in turn, this decrement determines the number of continuous derivatives of sum of this…
Given a finite group $G$, the \emph{Prime Order Element (POE) Graph} $\Gamma(G)$ consists of the group elements as the vertices, and two vertices $x$ and $y$ are adjacent if and only if $o(xy)$ is prime. This paper presents a thorough…
We show the nonequivalence of combinations of several natural geometric restrictions on trapezoid representations of trapezoid orders. Each of the properties unit parallelogram, unit trapezoid and proper parallelogram, unit trapezoid and…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…
In this paper we study substitutions and some of their associated generating functions. This association takes aperiodicity to transcendence, and vice-versa. These generating functions have a recursive structure arising from the…
In this paper we consider periodic orbits of planar linear Filippov systems with a line of discontinuity. Unlike many publications researching only the maximum number of crossing periodic orbits, we investigate not only the number and…
A graph generative model defines a distribution over graphs. One type of generative model is constructed by autoregressive neural networks, which sequentially add nodes and edges to generate a graph. However, the likelihood of a graph under…
Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…
We generalize and reprove an identity of Parker and Loday. It states that certain pairs of generating series associated to pairs of labelled rooted planar trees are mutually inverse under composition.
A superdiagonal composition is one in which the $i$-th part or summand is of size greater than or equal to $i$. In this paper, we study the number of palindromic superdiagonal compositions and colored superdiagonal compositions. In…
In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…
A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…
Arrival of multicore systems has enforced a new scenario in computing, the parallel and distributed algorithms are fast replacing the older sequential algorithms, with many challenges of these techniques. The distributed algorithms provide…
We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…
We study linear divisibility sequences of order 4, providing a characterization by means of their characteristic polynomials and finding their factorization as a product of linear divisibility sequences of order 2. Moreover, we show a new…