Related papers: Compositions constrained by graph Laplacian minors
The cyclic shift graph of a monoid is the graph whose vertices are elements of the monoid and whose edges link elements that differ by a cyclic shift. For certain monoids connected with combinatorics, such as the plactic monoid (the monoid…
In this work we consider the Laplacian controllability of a graph constructed by interconnecting a finite number of single-input Laplacian controllable graphs. We first study the interconnection realized by the composite graph of two…
We study random typical minimal factorizations of the $n$-cycle into transpositions, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions. By viewing transpositions as chords of the unit disk and by reading them…
We develop the deformation theory of symplectic foliations, i.e. regular foliations equipped with a leafwise symplectic form. The main result of this paper is that each symplectic foliation has an attached $L_\infty$-algebra controlling its…
In this survey we overview known results and get several new results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. After an introductory section, the paper is divided into six…
The low-energy effective theories describing string compactifications in the presence of fluxes are so-called gauged supergravities: deformations of the standard abelian supergravity theories. The deformation parameters can be identified…
A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered $\sigma$-structure is the expansion of a $\sigma$-structure with a…
Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable…
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…
We introduce a family of post-critically finite fractal trees indexed by the number of branches they possess. Then we produce a Laplacian operator on graph approximations to these fractals and use spectral decimation to describe the…
In this work, we study the composition operators on the little Lipschitz space ${\mathcal L}_0$ of a rooted tree $T$, defined as the subspace of the Lipschitz space ${\mathcal L}$ consisting of the complex-valued functions $f$ on $T$ such…
We establish two results concerning the Quantum Limits (QLs) of some sub-Laplacians. First, under a commutativity assumption on the vector fields involved in the definition of the sub- Laplacian, we prove that it is possible to split any QL…
We study string compactifications with sixteen supersymmetries. The moduli space for these compactifications becomes quite intricate in lower dimensions, partly because there are many different irreducible components. We focus primarily,…
A graph is chordal if it contains no induced cycle of length four or more. While finite chordal graphs are precisely those admitting tree-decompositions into cliques, this fails for infinite graphs. We establish two results extending the…
Networks with a prescribed power-law scaling in the spectrum of the graph Laplacian can be generated by evolutionary optimization. The Laplacian spectrum encodes the dynamical behavior of many important processes. Here, the networks are…
Graphs are fundamental mathematical structures used in various fields to represent data, signals and processes. In this paper, we propose a novel framework for learning/estimating graphs from data. The proposed framework includes (i)…
We generalize recent work of Andrews, Just, and Simay on modular palindromic compositions and anti-palindromic compositions by viewing all compositions partially (modular) palindromic or anti-palindromic. More precisely, we enumerate…
Certifying feasibility in decision-making, critical in many industries, can be framed as a constraint satisfaction problem. This paper focuses on characterising a subset of parameter values from an a priori set that satisfy constraints on a…
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
Singular theories, characterised by the presence of degeneracies in their Lagrangian or Hamiltonian descriptions, require the systematic implementation of constraints in order to obtain well-defined dynamics. While the symplectic framework…