English
Related papers

Related papers: An explicit counterexample to the Lagarias-Wang fi…

200 papers

Let $G$ be an infinite group and let $X$ be a finite generating set for $G$ such that the growth series of $G$ with respect to $X$ is a rational function; in this case $G$ is said to have rational growth with respect to $X$. In this paper a…

Group Theory · Mathematics 2019-01-18 Motiejus Valiunas

The theory of affine processes on the space of positive semidefinite d x d matrices has been established in a joint work with Cuchiero, Filipovi\'c and Teichmann (2011). We confirm the conjecture stated therein that in dimension d greater…

Probability · Mathematics 2013-01-15 Eberhard Mayerhofer

Products of $M$ i.i.d. random matrices of size $N \times N$ are related to classical limit theorems in probability theory ($N=1$ and large $M$), to Lyapunov exponents in dynamical systems (finite $N$ and large $M$), and to universality in…

Probability · Mathematics 2022-12-19 Dang-Zheng Liu , Dong Wang , Yanhui Wang

We show that resonant frequencies of a system of coupled resonators in a truncated periodic lattice converge to the essential spectrum of corresponding infinite lattice. We use the capacitance matrix as a model for fully coupled resonators…

Mathematical Physics · Physics 2023-05-29 Habib Ammari , Bryn Davies , Erik Orvehed Hiltunen

The joint spectral radius (JSR) of a set of matrices characterizes the maximal asymptotic growth rate of an infinite product of matrices of the set. This quantity appears in a number of applications including the stability of switched and…

Optimization and Control · Mathematics 2017-10-06 B. Legat , P. A. Parrilo , R. M. Jungers

A well known upper bound for the spectral radius of a graph, due to Hong, is that $\mu_1^2 \le 2m - n + 1$. It is conjectured that for connected graphs $n - 1 \le s^+ \le 2m - n + 1$, where $s^+$ denotes the sum of the squares of the…

Combinatorics · Mathematics 2015-09-21 Clive Elphick , Felix Goldberg , Miriam Farber , Pawel Wocjan

An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…

Combinatorics · Mathematics 2026-05-22 Jingjie Yang , Mikołaj Bojańczyk , Bartek Klin

In previous papers, [M1, M2], [M3], we proved the existence as well as regularity of a finite range decomposition for the resolvent $G_{\alpha} (x-y,m^2) = ((-\Delta)^{\alpha\over 2} + m^{2})^{-1} (x-y) $, for $0<\alpha <2$ and all real…

Mathematical Physics · Physics 2017-08-02 P. K. Mitter

The invariant polytope algorithm was a breakthrough in the joint spectral radius computation, allowing to find the exact value of the joint spectral radius for most matrix families~\cite{GP2013,GP2016}. This algorithm found many…

Numerical Analysis · Mathematics 2025-05-16 Thomas Mejstrik

Given a real semisimple connected Lie group $G$ and a discrete subgroup $\Gamma < G$ we prove a precise connection between growth rates of the group $\Gamma$, polyhedral bounds on the joint spectrum of the ring of invariant differential…

Representation Theory · Mathematics 2025-09-09 Christopher Lutsko , Tobias Weich , Lasse L. Wolf

Infinite antichains of permutations have long been used to construct interesting permutation classes and counterexamples. We prove the existence and detail the construction of infinite antichains with arbitrarily large growth rates. As a…

Combinatorics · Mathematics 2012-12-18 Michael H. Albert , Robert Brignall , Vincent Vatter

Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…

Combinatorics · Mathematics 2025-09-17 Nathan Bowler , Attila Joó

Motivated by applications to perverse sheaves, we study combinatorics of two cell decompositions of the symmetric product of the complex line, refining the complex stratification by multiplicities. Contingency matrices, appearing in…

Geometric Topology · Mathematics 2020-07-08 Mikhail Kapranov , Vadim Schechtman

We propose a new conjecture on the relation between the species doubling of lattice fermions and the topology of manifold on which the fermion action is defined. Our conjecture claims that the maximal number of fermion species on a…

High Energy Physics - Lattice · Physics 2025-06-03 Jun Yumoto , Tatsuhiro Misumi

In 1993, Fishburn and Graham established the following qualitative extension of the classical Erd\H{o}s-Szekeres theorem. If $N$ is sufficiently large with respect to $n$, then any $N\times N$ real matrix contains an $n\times n$ submatrix…

Combinatorics · Mathematics 2023-05-12 Recep Altar Çiçeksiz , Zhihan Jin , Eero Räty , István Tomon

We establish, under a moment matching hypothesis, the local universality of the correlation functions associated with products of $M$ independent iid random matrices, as $M$ is fixed, and the sizes of the matrices tend to infinity. This…

Probability · Mathematics 2019-04-25 Phil Kopel , Sean O'Rourke , Van Vu

In $2014$, Gupta and Ray proved that the circulant involutory matrices over the finite field $\mathbb{F}_{2^m}$ can not be maximum distance separable (MDS). This non-existence also extends to circulant orthogonal matrices of order $2^d…

Cryptography and Security · Computer Science 2024-06-26 Tapas Chatterjee , Ayantika Laha

A new notion of thickness for subsets of $B[0,1]\subset \mathbb{R}^n$ called affine thickness is defined; this notion of thickness is a generalisation of Falconer-Yavicoli thickness and is adapted to be used in the study of certain sets…

Metric Geometry · Mathematics 2026-01-26 Richard A. Howat

The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…

Mathematical Physics · Physics 2008-11-18 D H Gebremedhin , C A Weatherford , X Zhang , A Wynn , G Tanaka

F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their results is that if there is a finite separation, then the optimal…

Combinatorics · Mathematics 2019-04-15 Attila Joó