Related papers: Nets in $\mathbb P^2$ and Alexander Duality
We provide general formulae for the configurational exponents of an arbitrary polymer network connected to the surface of an arbitrary wedge of the two-dimensional plane, where the surface is allowed to assume a general mixture of boundary…
This paper presents proof nets for multiplicative-additive linear logic (MALL), called conflict nets. They are efficient, since both correctness and translation from a proof are p-time (polynomial time), and abstract, since they are…
This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first one sees places as generators of a commutative monoid and…
With the increasing number of texts made available on the Internet, many applications have relied on text mining tools to tackle a diversity of problems. A relevant model to represent texts is the so-called word adjacency (co-occurrence)…
Many real networks feature the property of nestedness, i.e. the neighbours of nodes with a few connections are hierarchically nested within the neighbours of nodes with more connections. Despite the abstract simplicity of this notion,…
We consider the well-posedness of a class of hyperbolic partial differential equations on a one dimensional spatial domain. This class includes in particular infinite-dimensional networks of transport, wave and beam equations, or even…
The complete classification of (3,3)-nets and of (3,4)-nets with only double and triple points is given. Up to lattice isomorphism, there are exactly 3 effective possibilities in each case, and some of these provide new examples of…
Squarefree monomial ideals arising from finite meet-semilattices and their free resolutions are studied. For the squarefree monomial ideals corresponding to poset ideals in a distributive lattice the Alexander dual is computed.
We consider geodesic nets (critical points of a length functional on the space of embedded graphs) on doubled polygons (topological 2-spheres endowed with a flat metric away from finitely many cone singularities). We use the theorem of…
Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…
The family of planar graphs is a particularly important family and models many real-world networks. In this paper, we propose a principled framework based on the widely-known Apollonian packing process to generate new planar network, i.e.,…
We generalize our previous lattice construction of the abelian bosonization duality in $2+1$ dimensions to the entire web of dualities as well as the $N_f=2$ self-duality, via the lattice implementation of a set of modular transformations…
The surrounding of a vertex in a network can be more or less symmetric. We derive measures of a specific kind of symmetry of a vertex which we call degree symmetry -- the property that many paths going out from a vertex have overlapping…
An arrangement of hyperplanes is called formal, if the relations between the hyperplanes are generated by relations in codimension 2. Formality is not a combinatorial property, raising the question for a characterization for combinatorial…
Let $\mathcal{A}$ be a real line arrangement and $\mathcal{D}(\mathcal{A})$ the module of $\mathcal{A}$--derivations. First, we give a dynamical interpretation of $\mathcal{D}(\mathcal{A})$ as the set of polynomial vector fields which…
String art is an arrangement of pegs on a board with thread strung between these pegs to form beautiful geometric patterns. In this article, we consider a simple form of string art where pegs are placed on two diverging axes, and segments…
Existing information-theoretic frameworks based on maximum entropy network ensembles are not able to explain the emergence of heterogeneity in complex networks. Here, we fill this gap of knowledge by developing a classical framework for…
By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical…
Network science explores intricate connections among objects, employed in diverse domains like social interactions, fraud detection, and disease spread. Visualization of networks facilitates conceptualizing research questions and forming…
Two distinct structures of aggregates of atoms connected by anisotropic bonds with a network configuration are discussed from the viewpoint of a point set topology. A specific topological space connects the two types of topological…