Related papers: Supercyclidic nets
In this work, the topologies of networks constructed from time series from an underlying system undergo a period doubling cascade have been explored by means of the prevalence of different motifs using an efficient computational motif…
In this article initial steps in an analysis of cyclic networks of quantum logic gates is given. Cyclic networks are those in which the qubit lines are loops. Here we have studied one and two qubit systems plus two qubit cyclic systems…
Q-nets are maps from the square grid to projective space that have planar faces. We consider the Laplace sequences of Q-nets, which are determined by iterating a discrete time dynamics called Laplace transformations. In general, the Laplace…
We show that supersymmetry can provide a versatile platform in synthesizing a new class of optical structures with desired properties and functionalities. By exploiting the intimate relationship between superpatners, one can systematically…
Superbubbles are acyclic induced subgraphs of a digraph with single entrance and exit that naturally arise in the context of genome assembly and the analysis of genome alignments in computational biology. These structures can be computed in…
This paper provides a further step in our program of studying superconformal nets over S^1 from the point of view of noncommutative geometry. For any such net A and any family Delta of localized endomorphisms of the even part A^gamma of A,…
Esnault-Viehweg developed the theory of cyclic branched coverings $\tilde X\to X$ of smooth surfaces providing a very explicit formula for the decomposition of $H^1(\tilde X,\mathbb{C})$ in terms of a resolution of the ramification locus.…
We prove analogues of several well-known results concerning rational morphisms between quadrics for the class of so-called quasilinear $p$-hypersurfaces. These hypersurfaces are nowhere smooth over the base field, so many of the geometric…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
In this paper, we present necessary and sufficient combinatorial conditions for a link to be projective, that is, a link in $RP^3$. This characterization is closely related to the notions of antipodally self-dual and antipodally symmetric…
Let $K$ be a finitely generated field. We construct an $n$-dimensional linear system $\mathcal{L}$ of hypersurfaces of degree $d$ in $\mathbb{P}^n$ defined over $K$ such that each member of $\mathcal{L}$ defined over $K$ is smooth, under…
We present a discrete theory for modeling developable surfaces as quadrilateral meshes satisfying simple angle constraints. The basis of our model is a lesser known characterization of developable surfaces as manifolds that can be…
Real networks often form interacting parts of larger and more complex systems. Examples can be found in different domains, ranging from the Internet to structural and functional brain networks. Here, we show that these multiplex systems are…
Control of complex processes is a major goal of network analyses. Most approaches to control nonlinearly coupled systems require the network topology and/or network dynamics. Unfortunately, neither the full set of participating nodes nor…
We propose the n-clique network as a powerful tool for understanding global structures of combined highly-interconnected subgraphs, and provide theoretical predictions for statistical properties of the n-clique networks embedded in a…
Webs are combinatorial diagrams used to encode homomorphisms between representations of Lie (super)algebras and related objects. This paper extends the theory of webs to the quantum group of type Q. We define a monoidal supercategory of…
There exist myriads of off-shell worldline supermultiplets for (N{\leq}32)-extended supersymmetry in which every supercharge maps a component field to precisely one other component field or its derivative. A subset of these extends to…
Robust heteroclinic networks are invariant sets that can appear as attractors in symmetrically coupled or otherwise constrained dynamical systems. These networks may have a very complicated structure that is poorly understood and determined…
Using the path lattice cohomology we provide a conceptual topological characterization of the geometric genus for certain complex normal surface singularities with rational homology sphere links, which is uniformly valid for all…
Within the supertwistor approach, we analyse the superconformal structure of 4D N = 2 compactified harmonic/projective superspace. In the case of 5D superconformal symmetry, we derive the superconformal Killing vectors and related building…