Related papers: Transitive oriented 3-Hypergraphs of cyclic orders
We introduce and study a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. Start with an oriented graph $G_0$ of initially occupied edges on $n$…
Percolation establishes the connectivity of complex networks and is one of the most fundamental critical phenomena for the study of complex systems. On simple networks, percolation displays a second-order phase transition; on multiplex…
Transit functions were introduced as models of betweenness on undirected structures. Here we introduce directed transit function as the directed analogue on directed structures such as posets and directed graphs. We first show that…
A Circumconic passes through a triangle's vertices. We define the Circumbilliard, a circumellipse to a generic triangle for which the latter is a 3-periodic. We study its properties and associated loci.
We recall several categories of graphs which are useful for describing homotopy-coherent versions of generalized operads (e.g. cyclic operads, modular operads, properads, and so on), and give new, uniform definitions for their morphisms.…
The complete lists of vector hyperbolic equations on the sphere that have integrable third order vector isotropic and anisotropic symmetries are presented. Several new integrable hyperbolic vector models are found. By their integrability we…
The fast protection of meshed HVDC grids requires the modeling of the transient phenomena affecting the grid after a fault. In the case of hybrid lines comprising both overhead and underground parts, the numerous generated traveling waves…
In our previous paper, Real Polynomials with a Complex Twist [see http://archives.math.utk.edu/ICTCM/VOL28/A040/paper.pdf], we used advancements in computer graphics that allow us to easily illustrate more complete graphs of polynomial…
Many real-world interactions (e.g., researcher collaborations and email communication) occur among multiple entities. These group interactions are naturally modeled as hypergraphs. In graphs, transitivity is helpful to understand the…
A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite.…
We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
In this paper, we study transitive partially hyperbolic diffeomorphisms with one-dimensional topologically neutral center, meaning that the length of the iterate of small center segments remains small. Such systems are dynamically coherent.…
In this paper we define 3-crossed modules for commutative (Lie) algebras and investigate the relation between this construction and the simplicial algebras. Also we define the projective 3-crossed resolution for investigate a higher…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
A graph $G=(V,E)$ is a \emph{word-representable graph} if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\in E$ for each $x\neq y$. In this paper we give an effective…
We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form a common generalization of chordal graphs and circular arc…
We extend the notion of an $H$-normal quotient digraph of an $H$-vertex-transitive digraph to that of an $H$-subnormal quotient digraph. Using these concepts, together with bipartite halves of bipartite digraphs, we show that, for each…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…
In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information…