Related papers: Characterizing Rothe Diagrams
Two-dimensional nine neighbor hood rectangular Cellular Automata rules can be modeled using many different techniques like Rule matrices, State Transition Diagrams, Boolean functions, Algebraic Normal Form etc. In this paper, a new model is…
A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n]^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to…
Association Rule Mining is a machine learning method for discovering the interesting relations between the attributes in a huge transaction database. Typically, algorithms for Association Rule Mining generate a huge number of association…
Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys. Rev.~E, 2005, 71, 026117-1, hierarchical random graphs are…
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…
Ramsey Theory deals with avoiding certain patterns. When constructing an instance that avoids one pattern, it is observed that other patterns emerge. For example, repetition emerges when avoiding arithmetic progression (Van der Waerden…
This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…
In the author's earlier work there appeared a new way to specify any smooth closed 4-manifold by a surface diagram, which consists of an orientable surface decorated with simple closed curves. These curves are cyclically indexed, and each…
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
Oriented matroids can serve as a tool of modeling of collective decision-making processes in contradictory problems of pattern recognition. We present a generalization of the committee techniques of pattern recognition to oriented matroids.…
The majorization relation orders the degree sequences of simple graphs into posets called dominance orders. As shown by Ruch and Gutman (1979) and Merris (2002), the degree sequences of threshold and split graphs form upward-closed sets…
A drawing of a graph is said to be a {\em straight-line drawing} if the vertices of $G$ are represented by distinct points in the plane and every edge is represented by a straight-line segment connecting the corresponding pair of vertices…
We consider the avoidance of patterns in inversion sequences that relate sorting via sorting machines including data structures such as pop stacks and stacks. Such machines have been studied under a variety of additional constraints and…
The paper characterizes $(2t+1)$-regular graphs with circular flow number $2 + \frac{2}{2t-1}$. For $t=1$ this is Tutte's characterization of cubic graphs with flow number 4. The class of cubic graphs is the only class of odd regular graphs…
Sequence rotation consists of a circular shift of the sequence's elements by a given number of positions. We present the four classic algorithms to rotate a sequence; the loop invariants underlying their correctness; detailed correctness…
The rook graph is a graph whose edges represent all the possible legal moves of the rook chess piece on a chessboard. The problem we consider is the following. Given any set $M$ containing pairs of cells such that each cell of the $m_1…
The topological classification of the inner mappings on the fully invariant regular components of the wandering set with a special attracting boundary up to the topological conjugacy is defined in terms of distinguishing graph. Two inner…
A large number of flows with distinctive patterns have been observed in experiments and simulations of Rayleigh-Benard convection in a water-filled cylinder whose radius is twice the height. We have adapted a time-dependent pseudospectral…
This work represents an in-depth study of the structural behavior of the Collatz sequences. We consider a finite arithmetic progression with a common difference is 2 and the number of terms in the sequence is equal to 2^n . After, we…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…