Related papers: Compositions constrained by graph Laplacian minors
We present a constraint model for the problem of producing a tree decomposition of a graph. The inputs to the model are a simple graph G, the number of nodes in the desired tree decomposition and the maximum cardinality of each node in that…
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
We give an efficient construction of a reasonably small dominating set in a circulant graph on $n$ notes and $k$ distinct chord lengths. This result is based on bounds on some double exponential sums. .
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
The constrained structure of the duality invariant form of Maxwell theory is considered in the Hamiltonian formulation of Dirac as well as from the symplectic viewpoint. Compared to the former the latter approach is found to be more…
We present a summary of some results from our article [BZ1] and other recent results on the so-called LVMB manifolds. We emphasize some features by taking a different point of view. We present a simple variant of the Delzant construction,…
This paper establishes various variational properties of parametrized versions of two convexity-preserving constructs that were recently introduced in the literature: the proximal composition of a function and a linear operator, and the…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
In this paper, we consider the convolutions of slanted half-plane mappings and strip mappings and generalize related results in general settings. We also consider a class of harmonic mappings containing slanted half-plane mappings and strip…
These lecture notes explain the construction and basic properties of the wonderful compactification of a complex semisimple group of adjoint type. An appendix discusses the more general case of a semisimple symmetric space.
For dendrite graphs from biological experiments on mouse's retinal ganglion cells, a paper by Nakatsukasa, Saito and Woei reveals a mysterious phase transition phenomenon in the spectra of the corresponding graph Laplacian matrices. While…
Exploring the relationship between geometry and the resonant frequencies of a shape is of interest to pure and applied mathematicians. These resonant frequencies are related to the spectrum of the Laplacian, a partial differential operator.…
In this paper, we extend the work of Andrews, Beck and Hopkins by considering partitions and compositions with bounded gaps between each pair of consecutive parts. We show that both their generating functions and two matrices determined by…
In this paper we consider a diffeomorphism $f$ of a compact manifold $M$ which contracts an invariant foliation $W$ with smooth leaves. If the differential of $f$ on $TW$ has narrow band spectrum, there exist coordinates $H _x:W_x\to T_xW$…
We show Laplacian algebras are maximal, and give applications to the Classical Invariant Theory of real orthogonal representations of compact groups, including: The solution of the Inverse Invariant Theory problem for finite groups. An…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive normal form with the property that unit propagation on the…
Let $\mathcal{L}(T,\lambda)=\sum_{k=0}^n(-1)^{k}c_{k}(T)\lambda^{n-k}$ be the characteristic polynomial of its Laplacian matrix of a tree $T$. This paper studied some properties of the generating function of the coefficients sequence $(c_0,…
We study a class of parametrizations of convex cones of positive semidefinite matrices with prescribed zeros. Each such cone corresponds to a graph whose non-edges determine the prescribed zeros. Each parametrization in this class is a…
Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…