Related papers: Compositions constrained by graph Laplacian minors
We show that, in the character variety of surface group representations into the Lie group $\mathrm{PSL}(2,\mathbb{R}) \times \mathrm{PSL}(2,\mathbb{R})$, the compactification of the maximal component introduced by the second author is a…
Guided by the symmetries of the Euler-Lagrange equations of motion, a study of the constrained dynamics of singular Lagrangians is presented. We find that these equations of motion admit a generalized Lie symmetry, and on the Lagrangian…
We formulate and prove relative versions of several classical decompositions known in the theory of Chevalley groups over commutative rings. As an application we obtain upper estimates for the width of principal congruence subgroups in…
We apply geometric group theory to study and interpret known concepts from Western music. We show that chords, the circle of fifths, scales and certain aspects of the first species of counterpoint are encoded in the Cayley graph of the…
This work is concerned with variational analysis of so-called spectral functions and spectral sets of matrices that only depend on eigenvalues of the matrix. Based on our previous work [H. T. B\`ui, M. N. B\`ui, and C. Clason, Convex…
We consider the problem of learning the structure of undirected graphical models with bounded treewidth, within the maximum likelihood framework. This is an NP-hard problem and most approaches consider local search techniques. In this…
We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia. Then we show that there is a sufficiently small perturbation of the nonzero weights…
A graph composition is a partition of the vertex set such that each member of the partition induces a connected sub- graph, and the composition number of a graph is the number of possible graph compositions. A partition of a set S of…
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
In this paper we study two classes of graphs, the (m,k)-stars and l-dependent graphs, investigating the relation between spectrum characteristics and graph structure: conditions on the topology and edge weights are given in order to get…
This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…
We derive, by means of variational techniques, a limiting description for a class of integral functionals under linear differential constraints. The functionals are designed to encode the energy of a high-contrast composite, that is, a…
Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. Laplacian--like energy of a graph is newly proposed…
We give an explicit construction of the scaling limit of the minimum spanning tree of the complete graph. The limit object is described using a recursive construction involving the convex minorants of a Brownian motion with parabolic drift…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
We expand the structural theory of \ca graphs that avoid specific cyclic coset patterns. We present several characterisations of tree-likeness for these structures and show a close connection to $\alpha$-acyclic hypergraphs. A focus lies on…
We characterize the strictly increasing symbols $\varphi:\mathbb{N}_0\longrightarrow\mathbb{N}_0$ whose composition operators $C_{\varphi}$ satisfy the Frequent Hypercyclicity Criterion on the little Lipschitz space…
We consider the minimum-cut partitioning of a graph into more than two parts using spectral methods. While there exist well-established spectral algorithms for this problem that give good results, they have traditionally not been well…
In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We…
In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and…