English
Related papers

Related papers: How many matrices can be spectrally balanced simul…

200 papers

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of even grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with certain, explicitly…

Representation Theory · Mathematics 2023-12-29 Fernando De Terán , Andrii Dmytryshyn , Froilán M. Dopico

Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix $c>0$ and $p>0$. Let $A_n$ be the adjacency matrix…

Probability · Mathematics 2015-09-09 Zhiyi Chi

Let $M$ be a $n\times m$ $(0,1)$-matrix. We define the $s$-binary rank, $br_s(M)$, of $M$ to be the minimal integer $d$ such that there are $d$ monochromatic rectangles that cover all the $1$-entries in the matrix, and each $1$-entry is…

Data Structures and Algorithms · Computer Science 2023-01-12 Nader H. Bshouty

In this paper, we present some checkable criteria for the spectral finiteness of a finite subset of the real $d\times d$ matrix space $\mathbb{R}^{d\times d}$, where $2\le d<\infty$.

Numerical Analysis · Mathematics 2012-06-12 Xiongping Dai

An edge-colored graph is said to be balanced if it has an equal number of edges of each color. Given a graph $G$ whose edges are colored using two colors and a positive integer $k$, the objective in the Edge Balanced Connected Subgraph…

Data Structures and Algorithms · Computer Science 2024-04-03 P. S. Ardra , R. Krithika , Saket Saurabh , Roohani Sharma

We study the joint spectral properties of two coupled random matrices $H^{(1)}$ and $H^{(2)}$, which are either real symmetric or complex Hermitian. The entries of these matrices exhibit polynomially decaying correlations, both within each…

Probability · Mathematics 2025-03-28 Oleksii Kolupaiev

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…

Combinatorics · Mathematics 2016-02-10 Steven Klee , Isabella Novik

If $A$ is a $2n \times 2n$ real positive definite matrix, then there exists a symplectic matrix $M$ such that $M^TAM = \left [ \begin{array}{cc} D & O \\ O & D \end{array} \right ]$ where $D= \diag (d_1 (A), \ldots, d_n(A))$ is a diagonal…

Mathematical Physics · Physics 2018-03-21 Rajendra Bhatia , Tanvi Jain

Let $G = (V,E)$ be a graph on $n$ vertices and let $m^*(G)$ denote the size of a maximum matching in $G$. We show that for any $\delta > 0$ and for any $1 \leq k \leq (1-\delta)m^*(G)$, the down-up walk on matchings of size $k$ in $G$ mixes…

Data Structures and Algorithms · Computer Science 2024-08-08 Vishesh Jain , Clayton Mizgerd

The maximum of the absolute value of a real homogeneous polynomial of degree $d\ge 3$ on the unit sphere corresponds to the spectral norm of the induced real $d$-symmetric tensor $\mathcal{S}$. We give two sequences of upper bounds on the…

Functional Analysis · Mathematics 2021-04-20 Shmuel Friedland

A perfect matching in a graph $G$ is a set of nonadjacent edges covering every vertex of $G$. Motivated by recent progress on the relations between the eigenvalues and the matching number of a graph, in this paper, we aim to present a…

Combinatorics · Mathematics 2021-01-13 Yuke Zhang , Huiqiu Lin

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

This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable and the set of admissible switching signals obeys pre-specified restrictions on switches between the subsystems and dwell times on…

Systems and Control · Electrical Eng. & Systems 2021-11-11 Atreyee Kundu

We characterize possible spectra of rank-one perturbations B of a self-adjoint operator A with discrete spectrum and, in particular, prove that the spectrum of B may include any number of real or non-real eigenvalues of arbitrary algebraic…

Spectral Theory · Mathematics 2020-06-23 Oles Dobosevych , Rostyslav Hryniv

Recently, the quaternionic quantum walk was formulated by the first author as a generalization of discrete-time quantum walks. We treat the right eigenvalue problem of quaternionic matrices to analysis the spectra of its transition matrix.…

Mathematical Physics · Physics 2015-05-05 Norio Konno , Hideo Mitsuhashi , Iwao Sato

We consider three matroids defined by Kalai in 1985: the symmetric completion matroid $\mathcal{S}_d$ on the edge set of a looped complete graph; the hyperconnectivity matroid $\mathcal{H}_d$ on the edge set of a complete graph; and the…

Combinatorics · Mathematics 2026-03-17 Dániel Garamvölgyi , Bill Jackson , Tibor Jordán , Soma Villányi

A classical result by Pachner states that two $d$-dimensional combinatorial manifolds with boundary are PL homeomorphic if and only they can be connected by a sequence of shellings and inverse shellings. We prove that for balanced, i.e.,…

Combinatorics · Mathematics 2018-04-18 Martina Juhnke-Kubitzke , Lorenzo Venturello

Any Zariski dense countable subgroup of $SL(d,R)$ is shown to carry a non-degenerate finitely supported symmetric random walk such that its harmonic measure on the flag space is singular. The main ingredients of the proof are: (1) a new…

Probability · Mathematics 2008-07-08 Vadim A. Kaimanovich , Vincent Le Prince

Given an integral domain A we consider the set of all integral elements over A that can occur as an eigenvalue of a symmetric matrix over A. We give a sufficient criterion for being such an element. In the case where A is the ring of…

Number Theory · Mathematics 2016-08-12 Mario Kummer

Consider a directed multigraph $D$ that is balanced (i.e., at each vertex, the indegree equals the outdegree). Let $A$ be its set of arcs. Fix an integer $k$. Let $s$ be a vertex of $D$. We show that the number of $k$-element subsets $B$ of…

Combinatorics · Mathematics 2025-11-21 Darij Grinberg , Benjamin Liber