English
Related papers

Related papers: Nets in $\mathbb P^2$ and Alexander Duality

200 papers

Modern applications of algebraic topology to point cloud data analysis have motivated active investigation of combinatorial clique complexes -- high-dimensional extensions of combinatorial graphs. We show that meaningful invariants of such…

Algebraic Topology · Mathematics 2014-10-29 Gregory Henselman , Paweł Dłotko

Assortative mixing in networks is the tendency for nodes with the same attributes, or metadata, to link to each other. It is a property often found in social networks manifesting as a higher tendency of links occurring between people with…

Social and Information Networks · Computer Science 2018-04-19 Leto Peel , Jean-Charles Delvenne , Renaud Lambiotte

Relations between discrete quantities such as people, genes, or streets can be described by networks, which consist of nodes that are connected by edges. Network analysis aims to identify important nodes in a network and to uncover…

Numerical Analysis · Mathematics 2021-09-21 A. Concas , S. Noschese , L. Reichel , G. Rodriguez

Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…

Metric Geometry · Mathematics 2024-12-09 Stephen Y Zhang , Fangfei Lan , Youjia Zhou , Agnese Barbensi , Michael P H Stumpf , Bei Wang , Tom Needham

We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…

Algebraic Geometry · Mathematics 2019-07-19 Krishna Hanumanthu , Brian Harbourne

Let $\mathcal{A}$ be a real line arrangement and $\mathcal{D}(\mathcal{A})$ the module of $\mathcal{A}$-derivations view as the set of polynomial vector fields which possess $\mathcal{A}$ as an invariant set. We first characterize…

Dynamical Systems · Mathematics 2015-04-23 Benoît Guerville-Ballé , Juan Viu-Sos

This paper initiates the dialectical approach to net theory. This approach views nets as special, but very important and natural, dialectical systems. By following this approach, a suitably generalized version of nets, called dialectical…

Logic in Computer Science · Computer Science 2018-10-16 Robert E. Kent

Identifying and explaining the structure of complex networks at different scales has become an important problem across disciplines. At the mesoscale, modular architecture has attracted most of the attention. At the macroscale, other…

Physics and Society · Physics 2018-11-09 María J. Palazzi , Javier Borge-Holthoefer , Claudio Tessone , Albert Solé-Ribalta

Let $\Delta$ be a $g_2$-minimal normal 3-pseudomanifold. A vertex in $\Delta$ whose link is not a sphere is called a singular vertex. When $\Delta$ contains at most two singular vertices, its combinatorial characterization is known [9]. In…

Combinatorics · Mathematics 2025-05-27 Biplab Basak , Raju Kumar Gupta , Sourav Sarkar

The lattice of flats $\mathcal L_M$ of a matroid $M$ is combinatorially well-behaved and, when $M$ is realizable, admits a geometric model in the form of a "Schubert variety of hyperplane arrangement". In contrast, the lattice of flats of a…

Algebraic Geometry · Mathematics 2025-09-19 Colin Crowley , Connor Simpson , Botong Wang

A network embedding is a representation of a large graph in a low-dimensional space, where vertices are modeled as vectors. The objective of a good embedding is to preserve the proximity between vertices in the original graph. This way,…

Artificial Intelligence · Computer Science 2017-01-20 Zhipeng Huang , Nikos Mamoulis

We introduce polytopal cell complexes associated with partial acyclic orientations of a simple graph, which generalize acyclic orientations. Using the theory of cellular resolutions, two of these polytopal cell complexes are observed to…

Combinatorics · Mathematics 2015-02-10 Benjamin Iriarte Giraldo

We investigate the duality structure of quantum lattice systems with topological order, a collective order also appearing in fractional quantum Hall systems. We define electromagnetic (EM) duality for all of Kitaev's quantum double models…

Strongly Correlated Electrons · Physics 2013-10-09 Oliver Buerschaper , Matthias Christandl , Liang Kong , Miguel Aguado

We will define the Alexander duality for strongly stable ideals. More precisely, for a strongly stable ideal $I \subset \Bbbk[x_1, \ldots, x_n]$ with ${\rm deg}(\mathsf{m}) \le d$ for all $\mathsf{m} \in G(I)$, its dual $I^* \subset…

Commutative Algebra · Mathematics 2019-09-23 Kosuke Shibata , Kohji Yanagawa

The architecture of a neural network constrains the potential dynamics that can emerge. Some architectures may only allow for a single dynamic regime, while others display a great deal of flexibility with qualitatively different dynamics…

Combinatorics · Mathematics 2020-08-04 Carina Curto , Christopher Langdon , Katherine Morrison

Virtually all network analyses involve structural measures between pairs of vertices, or of the vertices themselves, and the large amount of symmetry present in real-world complex networks is inherited by such measures. This has practical…

Combinatorics · Mathematics 2020-08-05 Rubén J. Sánchez-García

Given a real arrangement $A$, the complement $M(A)$ of the complexification of $A$ admits an action of $\mathbb{Z}_2$ by complex conjugation. We define the equivariant Orlik-Solomon algebra of $A$ to be the $\mathbb{Z}_2$-equivariant…

Combinatorics · Mathematics 2007-05-23 Nicholas J. Proudfoot

The class of simplicial complexes representing triangulations and subdivisions of Lawrence polytopes is closed under Alexander duality. This gives a new geometric model for oriented matroid duality.

Combinatorics · Mathematics 2010-06-15 Francisco Santos , Bernd Sturmfels

We classify nets of conics in Desarguesian projective planes over finite fields of odd order, namely, two-dimensional linear systems of conics containing a repeated line. Our proof is geometric in the sense that we solve the equivalent…

Combinatorics · Mathematics 2020-03-16 Michel Lavrauw , Tomasz Popiel , John Sheekey

This work studies the limitations of uniquely identifying the structure (i.e., topology) of a networked linear system from partial measurements of its nodal dynamics. In general, many networks can be consistent with these measurements; this…

Systems and Control · Electrical Eng. & Systems 2026-03-13 Jaidev Gill , Jing Shuang Li