Related papers: M\"obius Inversion and Duality for Summations of S…
We present the program Boundary, whose source files are available at http://people.sissa.it/~maggiolo/boundary/. Given two natural numbers g and n satisfying 2g+n-2>0, the program generates all genus g stable graphs with n unordered marked…
A unitary shift operator (GSO) for signals on a graph is introduced, which exhibits the desired property of energy preservation over both backward and forward graph shifts. For rigour, the graph differential operator is also derived in an…
This paper is part of an ongoing series of works on the study of foliations on algebraic varieties via derived algebraic geometry. We focus here on the specific case of globally defined vector fields and the global behaviour of their…
We generalize the character formulas for multiplicities of irreducible constituents from group theory to semigroup theory using Rota's theory of M\"obius inversion. The technique works for a large class of semigroups including: inverse…
We introduce M\"obius functions of higher rank, a new class of arithmetic functions so that the classical M\"obius function is of rank 2. With this idea, we evaluate Dirichlet series on the sum of the reciprocal square of all $r$-free…
In this paper, we study the dualization in distributive lattices, a generalization of the well-known hypergraph dualization problem. We in particular propose equivalent formulations of the problem in terms of graphs, hypergraphs, and…
We revisit the classical phenomenon of duality between random integer-valued height functions with positive definite potentials and abelian spin models with O(2) symmetry. We use it to derive new results in quite high generality including:…
We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
In this paper, we introduce a birationally admissible stratification on the Deligne-Mumford stack of stable minimal models (e.g., the KSBA moduli stack), such that the universal family over each stratum admits a simple normal crossing log…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Let X be a non-singular algebraic curve of genus at least 3 and let M denote the moduli space of stable vector bundles of rank n and fixed determinant of degree d with n and d coprime. For any semistable bundle E over X, we can pull E back…
This paper introduces and studies the stability of the strong domination number of a graph, denoted $\operatorname{st}_{\gamma_{st}}(G)$, defined as the minimum number of vertices whose removal changes the strong domination number…
In this paper we aim to present two general results regarding, on one hand, the openness stability of set-valued maps and, on the other hand, the metric regularity behavior of the implicit multifunction related to a generalized variational…
We present the operator semigroups approach to first- and second-order dynamical systems taking place on metric graphs. We briefly survey the existing results and focus on the well-posedness of the problems with standard vertex conditions.…
We investigate the standard stable manifold theorem in the context of a partially hyperbolic singu-larity of a vector field depending on a parameter. We prove some estimates on the size of the neighbourhood where the local stable manifold…
Graphs are a central tool in machine learning and information processing as they allow to conveniently capture the structure of complex datasets. In this context, it is of high importance to develop flexible models of signals defined over…
To any saturated chain in the affine Weyl group whose translation parts are sufficiently regular, we associate a near path and a far path in the quantum Bruhat graph. Using this, working in the Bruhat order on the minimal-length…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
We describe the topology of superlevel sets of ($\alpha$-stable) L\'evy processes X by introducing so-called stochastic $\zeta$-functions, which are defined in terms of the widely used $\text{Pers}_p$-functional in the theory of persistence…