Related papers: The Only Complex 4-Net Is the Hesse Configuration
Upon a matrix representation of a binary bipartite network, via the permutation invariance, a coupling geometry is computed to approximate the minimum energy macrostate of a network's system. Such a macrostate is supposed to constitute the…
We compute the Betti numbers and describe the cohomology algebras of the ordered and unordered configuration spaces of three points in complex projective spaces, including the infinite dimensional case. We also compute these invariants for…
We present the complex analytic and principal complex analytic realizability of a link in a 3-manifold $M$ as a tool for understanding the complex structures on the cone $C(M)$.
The tonnetz, which is commonly represented as a tessellation of the plane by a triangular network of tones, can also be represented as a bipartite graph of degree three with twelve vertices denoting major triads and twelve vertices denoting…
We find a new structural feature of equilibrium complex random networks without multiple and self-connections. We show that if the number of connections is sufficiently high, these networks contain a core of highly interconnected vertices.…
Confocal conics form an orthogonal net. Supplementing this net with one of the following: 1) the net of Cartesian coordinate lines aligned along the principal axes of conics, 2) the net of Apollonian pencils of circles whose foci coincide…
Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a starting configuration (a location and a direction of travel)…
We show that it is coNP-complete to decide whether a given proof structure of pomset logic is a correct proof net, using the graph-theoretic used in a previous paper of ours (arXiv:1901.10247).
A complex network is a condensed representation of the relational topological framework of a complex system. A main reason for the existence of such networks is the transmission of items through the entities of these complex systems. Here,…
A \v{C}ech complex of a finite simple graph $G$ is a nerve complex of balls in the graph, with one ball centered at each vertex. More precisely, let the \v{C}ech complex $\mathcal{N}(G,r)$ be the nerve of all closed balls of radius…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
In the projective plane, we consider congruences of straight lines with the combinatorics of the square grid and with all elementary quadrilaterals possessing touching inscribed conics. The inscribed conics of two combinatorially…
Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…
We show that a hyperbolic 2-bridge knot complement is the unique knot complement in its commensurability class. We also discuss constructions of commensurable hyperbolic knot complements and put forth a conjecture on the number of…
A constructive characterization of the class of uniformly $4$-connected graphs is presented. The characterization is based on the application of graph operations to appropriate vertex and edge sets in uniformly $4$-connected graphs, that…
We show that there are only finitely many combinatorial types of free real line arrangements with only double, triple and quadruple intersection points, and we enlist all admissible weak-combinatorics of them. Then we classify all real…
We show that the problem of recognizing that a knot diagram represents a specific torus knot, or any torus knot at all, is in the complexity class ${\sf NP} \cap {\sf co\text{-}NP}$, assuming the generalized Riemann hypothesis. We also show…
We show that the simple update approach proposed by Jiang et. al. [H.C. Jiang, Z.Y. Weng, and T. Xiang, Phys. Rev. Lett. 101, 090603 (2008)] is an efficient and accurate method for determining the infinite tree tensor network states on the…
In this paper we prove that if a knot or link has a sufficiently complicated plat projection, then that plat projection is unique. More precisely, if a knot or link has a $2m$-plat projection, where $m$ is at least four, and height at least…
In this paper, we introduce transformations of deep rectifier networks, enabling the conversion of deep rectifier networks into shallow rectifier networks. We subsequently prove that any rectifier net of any depth can be represented by a…