Related papers: The Only Complex 4-Net Is the Hesse Configuration
There exist a finite number of natural numbers n for which we do not know whether a realizable n_4-configuration does exist. We settle the two smallest unknown cases n=15 and n=16. In these cases realizable n_4-configurations cannot exist…
We introduce a novel technique for checking reachability in Petri nets that relies on a recently introduced compositional algebra of nets. We prove that the technique is correct, and discuss our implementation. We report promising…
A bipartite graph is {\em pseudo 2--factor isomorphic} if all its 2--factors have the same parity of number of circuits. In \cite{ADJLS} we proved that the only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite graph…
Systematic enumeration of crystalline networks with some special topological characters is of considerable interest in both mathematics and crystallography. Based on the restriction of lattice in cubic and inequivalent nodes not exceeding…
We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by…
We study the non-trivial central extensions $CEHeis$ of the Heisenberg algebra $Heis$ recently constructed in {AccBouCE}. We prove that a real form of $CEHeis$ is one the fifteen classified real four--dimensional solvable Lie algebras. We…
For $p\in\{2,3\}$ it is known that a saturated $p$-fusion system is realizable if and only if each of its components is realizable by a finite simple group. For primes $p\geq 5$ this is false. Building on work of Broto, M{\o}ller, Oliver…
We construct an infinite family of 4-polytopes whose realization spaces have dimension smaller or equal to 96. This in particular settles a problem going back to Legendre and Steinitz: whether and how the dimension of the realization space…
In a previous paper we introduced immediate observation Petri nets, a subclass of Petri nets with application domains in distributed protocols (population protocols) and theoretical chemistry (chemical reaction networks). IO nets enjoy many…
A simplicial complex is $r$-conic if every subcomplex of at most $r$ vertices is contained in the star of a vertex. A $4$-conic complex is simply connected. We prove that an $8$-conic complex is $2$-connected. In general a $(2n+1)$-conic…
One proves that there exists an obstruction to an open simply connected $n$-manifold of dimension $n\geq 5$ being geometrically simply connected. In particular there exist uncountably many simply connected $n$-manifolds which are not…
The full set of polynomial solutions of the nested Bethe Ansatz is constructed for the case of A_2 rational spin chain. The structure and properties of these associated solutions are more various then in the case of usual XXX (A_1) spin…
An intriguing correspondence between four-qubit systems and simple singularity of type $D_4$ is established. We first consider an algebraic variety $X$ of separable states within the projective Hilbert space…
Complex networks can be understood as graphs whose connectivity deviates from those of regular or near-regular graphs, which are understood as being `simple'. While a great deal of the attention so far dedicated to complex networks has been…
Let $n$ points be in crescent configurations in $\mathbb{R}^d$ if they lie in general position in $\mathbb{R}^d$ and determine $n-1$ distinct distances, such that for every $1 \leq i \leq n-1$ there is a distance that occurs exactly $i$…
We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem is NP-complete for general neural networks and conjunctive…
We consider the establishment of connections in survivable networks, where each connection is allocated with a working (primary) path and a protection (backup) path. While many optimal solutions have been found for the establishment of a…
A branched covering $f: S^2 \to S^2$ is a nearly Euclidean Thurston (NET) map if each critical point is simple and its postcritical set has exactly four points. We show that up to equivalence, each NET map admits a normal form in terms of…
We study heteroclinic networks in $\mathbb{R}^4$, made of a certain type of simple robust heteroclinic cycle. In simple cycles all the connections are of saddle-sink type in two-dimensional fixed-point spaces. We show that there exist only…
We construct infinitely many smooth 4-manifolds which are homotopy equivalent to $S^2$ but do not admit a spine, i.e., a piecewise-linear embedding of $S^2$ which realizes the homotopy equivalence. This is the remaining case in the…