Related papers: Nets in $\mathbb P^2$ and Alexander Duality
We give a structure theorem for Cohen Macaulay monomial ideals of codimension 2, and describe all possible relation matrices of such ideals. In case that the ideal has a linear resolution, the relation matrices can be identified with the…
We develop a technique to formulate quantum field theory on arbitrary network, based on different, randomly disposed sets of scattering's. We define R-matrix of the whole network as a product of R-matrices attached to each of scattering…
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
A Jordan net (resp. web) is an embedding of a unital Jordan algebra of dimension $3$ (resp. $4$) into the space $\mathbb{S}^n$ of symmetric $n\times n$ matrices. We study the geometries of Jordan nets and webs: we classify the…
We show that the linear map defined by multiplication with a general bi-homogeneous form between two bi-graduated pieces of the first cohomology of a nonsingular quadric in the projective space is of maximal rank. This is the first non…
Numerical analysis of data from international trade and ecological networks has shown that the non-linear fitness-complexity metric is the best candidate to rank nodes by importance in bipartite networks that exhibit a nested structure.…
The $OS$ algebra $A$ of a matroid $M$ is a graded algebra related to the Whitney homology of the lattice of flats of $M$. In case $M$ is the underlying matroid of a hyperplane arrangement \A in $\C^r$, $A$ is isomorphic to the cohomology…
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…
In this paper we show a Zariski pair of sextics which is not a degeneration of the original example given by Zariski. This is the first example of this kind known. The two curves of the pair have a trivial Alexander polynomial. The…
Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…
In Functional Analysis, certain conclusions apply to sequences, but they cannot be carried over when we consider nets. In fact, some nets, including sequences, can behave unexpectedly. In this paper we are interested in exploring the…
Reconstructing the states of the nodes of a dynamical network is a problem of fundamental importance in the study of neuronal and genetic networks. An underlying related problem is that of observability, i.e., identifying the conditions…
We consider heteroclinic networks between $n \in \mathbb{N}$ nodes where the only connections are those linking each node to its two subsequent neighbouring ones. Using a construction method where all nodes are placed in a single…
Networks are widely used in the biological, physical, and social sciences as a concise mathematical representation of the topology of systems of interacting components. Understanding the structure of these networks is one of the outstanding…
Any mass action network gives rise to a parameterised family of polynomial equations whose positive solutions are the positive equilibria of the network. Here, we consider alternative systems of equations, whose solutions are in smooth,…
Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements…
We realize a given (monic) Alexander polynomial by a (fibered) hyperbolic arborescent knot and link of any number of components, and by infinitely many such links of at least 4 components. As a consequence, a Mahler measure minimizing…
There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix $N_2$ (defined by inclusion of pairs in edges) for one natural…
Probabilistic frames are a generalization of finite frames into the Wasserstein space of probability measures with finite second moment. We introduce new probabilistic definitions of duality, analysis, and synthesis and investigate their…
Real-world networks are often complex and large with millions of nodes, posing a great challenge for analysts to quickly see the big picture for more productive subsequent analysis. We aim at facilitating exploration of node-attributed…