English
Related papers

Related papers: Spectral decomposition of hypergraph automorphism …

200 papers

A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed…

Combinatorics · Mathematics 2022-06-28 Bo-Jun Yuan , Shaowei Sun , Dijian Wang

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…

Methodology · Statistics 2020-01-27 J. F. Lutzeyer , A. T. Walden

Via the process of isospectral graph reduction the adjacency matrix of a graph can be reduced to a smaller matrix while its spectrum is preserved up to some known set. It is then possible to estimate the spectrum of the original matrix by…

Spectral Theory · Mathematics 2015-03-13 L. A. Bunimovich , B. Z. Webb

If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…

Combinatorics · Mathematics 2018-11-08 Andrey O. Matveev

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…

Combinatorics · Mathematics 2017-03-30 Andrey O. Matveev

We present statistics on the decompositions (with respect to a distinguished symmetric 2t-cycle) of vertices of the hypercube graph, whose negative parts are regarded as disjoint unions of two subsets of the ground set {1,...,t} of the…

Combinatorics · Mathematics 2020-08-25 Andrey O. Matveev

In graph learning, maps between graphs and their subgraphs frequently arise. For instance, when coarsening or rewiring operations are present along the pipeline, one needs to keep track of the corresponding nodes between the original and…

Machine Learning · Computer Science 2023-02-01 Marco Pegoraro , Riccardo Marin , Arianna Rampini , Simone Melzi , Luca Cosmo , Emanuele Rodolà

A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…

Combinatorics · Mathematics 2021-01-22 Willem H. Haemers , Leila Parsaei Majd

Let $G_{g,b}$ be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus $g$ with $b$ boundary components. We describe the set $A_{g,b}$ of all automorphisms of…

Geometric Topology · Mathematics 2011-11-16 Silvia Benvenuti , Riccardo Piergallini

Extending a classic result of Johnson and Newman, this paper provides a matrix characterization for two generalized cospectral graphs with a pair of generalized cospectral vertex-deleted subgraphs. As an application, we present a new…

Combinatorics · Mathematics 2024-08-06 Wei Wang , Wenqiang Wen , Songlin Guo

The fusion rings associated to affine Kac-Moody algebras appear in several different contexts in math and mathematical physics. In this paper we find all automorphisms of all affine fusion rings, or equivalently the symmetries of the…

Quantum Algebra · Mathematics 2007-05-23 T. Gannon

Pseudo-harmonic morphisms give rise on the domain space to a distribution which admits an almost complex structure compatible with the given Riemannian metric. We shall show that this property, together with the harmonicity, are preserved…

Differential Geometry · Mathematics 2007-05-23 Radu Slobodeanu

Harmonicity of holomorphic maps between various subclasses of almost contact metric manifolds is discussed. Consequently, some new results are obtained. Also some known results are recovered, some of them are generalized and some of them…

Differential Geometry · Mathematics 2023-02-27 Sadettin Erdem

We study the equivalence between bipartiteness and symmetry of spectra of mixed graphs, for $\theta$-Hermitian adjacency matrices defined by an angle $\theta \in (0, \pi]$. We show that this equivalence holds when, for example, an angle…

Combinatorics · Mathematics 2023-02-08 Yusuke Higuchi , Sho Kubota , Etsuo Segawa

This paper presents a parametrization of a degenerate density matrix. The problem needs to be approached first with a diagonalized form (the spectral representation) to deal with degeneracy. Such a form is useful for this parametrization in…

Mathematical Physics · Physics 2013-09-06 Tae-Hun Lee

As a discrete analogue of Kac's celebrated question on "hearing the shape of a drum", and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their…

Combinatorics · Mathematics 2024-11-19 Illya Koval , Matthew Kwan

It is well known that the sum of negative (positive) eigenvalues of some finite Hermitian matrix $V$ is concave (convex) with respect to $V$. Using the theory of the spectral shift function we generalize this property to self-adjoint…

Spectral Theory · Mathematics 2007-05-23 Vadim Kostrykin

In this paper we study for the incompressible Euler equations the global structure of the bifurcation diagram for the rotating doubly connected patches near the degenerate case. We show that the branches with the same symmetry merge forming…

Analysis of PDEs · Mathematics 2017-10-11 Taoufik Hmidi , Coralie Renault

An automorphism on a complex supermanifold $\mathcal M$ is called unipotent if it reduces to the identity on the associated graded supermanifold $gr(\mathcal M)$. These automorphisms are close to be complementary to those responsible for…

Complex Variables · Mathematics 2016-07-26 Matthias Kalus

Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the…

Combinatorics · Mathematics 2020-01-01 Amitesh Sarkar , Anirban Banerjee
‹ Prev 1 3 4 5 6 7 10 Next ›