Substantially extending previous results of the authors for smooth solutions in the viscous case, we develop linear damping estimates for periodic roll-wave solutions of the inviscid Saint-Venant equations and related systems of hyperbolic balance laws. Such damping estimates, consisting of $H^s$ energy estimates yielding exponential slaving of high-derivative to low-derivative norms, have served as crucial ingredients in nonlinear stability analyses of traveling waves in hyperbolic or partially parabolic systems, both in obtaining high-frequency resolvent estimates and in closing a nonlinear iteration for which available linearized stability estimates apparently lose regularity. Here, we establish for systems of size $n\leq 6$ a Lyapunov-type theorem stating that such energy estimates are available whenever strict high-frequency spectral stability holds; for dimensions $7$ and higher, there may be in general a gap between high-frequency spectral stability and existence of the type of energy estimate that we develop here. A key ingredient is a dimension-dependent linear algebraic lemma reminiscent of Lyapunov’s Lemma for ODE that is to our knowledge new.

We give a new proof of the singular continuity of Minkowski’s $?$-function. Our proof follows by showing that the maximal Lyapunov exponent of a specific pair of $3\times 3$ nonnegative integer matrices related to Stern’s diatomic sequence is strictly greater than $\log 2$.

In this article, we present an elementary proof of the Cartan decomposition theorem for the group $ \mathrm {Sp}(1, n) $. As an application, we determine the largest regular domain for discrete quaternionic hyperbolic groups acting on $ \mathbb {HP}^n $. Furthermore, we demonstrate that Bers’ simultaneous uniformization and Köebe’s retrosection theorem fail to hold for higher-dimensional quaternionic Kleinian groups.

A 2009 article of Allcock and Vaaler explored the $\mathbb {Q}$-vector space $\mathcal {G} := \overline {\mathbb {Q}}^\times /{\overline {\mathbb {Q}}^\times _{\mathrm {tors}}}$, showing how to represent it as part of a function space on the places of $\overline {\mathbb {Q}}$. We establish a representation theorem for the $\mathbb {R}$-vector space of $\mathbb {Q}$-linear maps from $\mathcal {G}$ to $\mathbb {R}$, enabling us to classify extensions to $\mathcal {G}$ of completely additive arithmetic functions. We further outline a strategy to construct $\mathbb {Q}$-linear maps from $\mathcal {G}$ to $\mathbb {Q}$, i.e., elements of the algebraic dual of $\mathcal {G}$. Our results make heavy use of Dirichlet’s S-unit Theorem as well as a measure-like object called a consistent map, first introduced by the author in previous work.

The aim of this paper is to illustrate both analytically and numerically the interplay of two fundamentally distinct non-Hermitian mechanisms in the deep subwavelength regime. Considering a parity-time symmetric system of one-dimensional subwavelength resonators equipped with two kinds of non-Hermiticity – an imaginary gauge potential and on-site gain and loss – we prove that all but two eigenmodes of the system pass through exceptional points and decouple. By tuning the gain-to-loss ratio, the system changes from a phase with unbroken parity-time symmetry to a phase with broken parity-time symmetry. At the macroscopic level, this is observed as a transition from symmetrical eigenmodes to condensated eigenmodes at one edge of the structure. Mathematically, it arises from a topological state change. The results of this paper open the door to the justification of a variety of phenomena arising from the interplay between non-Hermitian reciprocal and nonreciprocal mechanisms not only in subwavelength wave physics but also in quantum mechanics, where the tight-binding model coupled with the nearest neighbour approximation can be analysed with the same tools as those developed here.

We say that a semigroup of matrices has a submultiplicative spectrum if the spectrum of the product of any two elements of the semigroup is contained in the product of the two spectra in question (as sets). In this note, we explore an approximate version of this condition.

We generalize Baker–Bowler’s theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets and orthogonal vector sets, and establish basic properties on functoriality, duality and minors. Our cryptomorphic definitions of orthogonal matroids over tracts provide proofs of several representation theorems for orthogonal matroids. In particular, we give a new proof that an orthogonal matroid is regular if and only if it is representable over ${\mathbb F}_2$ and ${\mathbb F}_3$, which was originally shown by Geelen [16], and we prove that an orthogonal matroid is representable over the sixth-root-of-unity partial field if and only if it is representable over ${\mathbb F}_3$ and ${\mathbb F}_4$.

This paper investigates structural changes in the parameters of first-order autoregressive (AR) models by analyzing the edge eigenvalues of the precision matrices. Specifically, edge eigenvalues in the precision matrix are observed if and only if there is a structural change in the AR coefficients. We show that these edge eigenvalues correspond to the zeros of a determinantal equation. Additionally, we propose a consistent estimator for detecting outliers within the panel time series framework, supported by numerical experiments.

Restriction is a natural quasi-order on d-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field; namely, that it is a well-quasi-order: it admits no infinite antichains and no infinite strictly decreasing sequences. This result, reminiscent of the graph minor theorem, has important consequences for an arbitrary restriction-closed tensor property X. For instance, X admits a characterisation by finitely many forbidden restrictions and can be tested by looking at subtensors of a fixed size. Our proof involves an induction over polynomial generic representations, establishes a generalisation of the tensor restriction theorem to other such representations (e.g., homogeneous polynomials of a fixed degree), and also describes the coarse structure of any restriction-closed property.

An element of a group is called strongly reversible or strongly real if it can be expressed as a product of two involutions. We provide necessary and sufficient conditions for an element of $\mathrm{SL}(n,\mathbb{C})$ to be a product of two involutions. In particular, we classify the strongly reversible conjugacy classes in $\mathrm{SL}(n,\mathbb{C})$.

We prove that the infinite half-spin representations are topologically Noetherian with respect to the infinite spin group. As a consequence, we obtain that half-spin varieties, which we introduce, are defined by the pullback of equations at a finite level. The main example for such varieties is the infinite isotropic Grassmannian in its spinor embedding, for which we explicitly determine its defining equations.

Let W be a group endowed with a finite set S of generators. A representation $(V,\rho )$ of W is called a reflection representation of $(W,S)$ if $\rho (s)$ is a (generalized) reflection on V for each generator $s \in S$. In this article, we prove that for any irreducible reflection representation V, all the exterior powers $\bigwedge ^d V$, $d = 0, 1, \dots , \dim V$, are irreducible W-modules, and they are non-isomorphic to each other. This extends a theorem of R. Steinberg which is stated for Euclidean reflection groups. Moreover, we prove that the exterior powers (except for the 0th and the highest power) of two non-isomorphic reflection representations always give non-isomorphic W-modules. This allows us to construct numerous pairwise non-isomorphic irreducible representations for such groups, especially for Coxeter groups.

Isoclinic subspaces have been studied for over a century. Quantum error correcting codes were recently shown to define a subclass of families of isoclinic subspaces. The Knill–Laflamme theorem is a seminal result in the theory of quantum error correction, a central topic in quantum information. We show there is a generalized version of the Knill–Laflamme result and conditions that applies to all families of isoclinic subspaces. In the case of quantum stabilizer codes, the expanded conditions are shown to capture logical operators. We apply the general conditions to give a new perspective on a classical subclass of isoclinic subspaces defined by the graphs of anti-commuting unitary operators. We show how the result applies to recently studied mutually unbiased quantum measurements (MUMs), and we give a new construction of such measurements motivated by the approach.

For a continuous-time phase-type (PH) distribution, starting with its Laplace–Stieltjes transform, we obtain a necessary and sufficient condition for its minimal PH representation to have the same order as its algebraic degree. To facilitate finding this minimal representation, we transform this condition equivalently into a non-convex optimization problem, which can be effectively addressed using an alternating minimization algorithm. The algorithm convergence is also proved. Moreover, the method we develop for the continuous-time PH distributions can be used directly for the discrete-time PH distributions after establishing an equivalence between the minimal representation problems for continuous-time and discrete-time PH distributions.

We investigate when the algebraic numerical range is a C-spectral set in a Banach algebra. While providing several counterexamples based on classical ideas as well as combinatorial Banach spaces, we discuss positive results for matrix algebras and provide an absolute constant in the case of complex $2\times 2$-matrices with the induced $1$-norm. Furthermore, we discuss positive results for infinite-dimensional Banach algebras, including the Calkin algebra.

Let Γ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. From an arbitrary basis $\mathcal B$ of $H^1(A(\Gamma),\mathbb F)$ over an arbitrary field, we construct a natural graph $\Gamma_{\mathcal B}$ from the cup product, called the cohomology basis graph. We show that $\Gamma_{\mathcal B}$ always contains Γ as a subgraph. This provides an effective way to reconstruct the defining graph Γ from the cohomology of $A(\Gamma)$, to characterize the planarity of the defining graph from the algebra of $A(\Gamma)$ and to recover many other natural graph-theoretic invariants. We also investigate the behaviour of the cohomology basis graph under passage to elementary subminors and show that it is not well-behaved under edge contraction.

Let R be a ring and let $n\ge 2$. We discuss the question of whether every element in the matrix ring $M_n(R)$ is a product of (additive) commutators $[x,y]=xy-yx$, for $x,y\in M_n(R)$. An example showing that this does not always hold, even when R is commutative, is provided. If, however, R has Bass stable rank one, then under various additional conditions every element in $M_n(R)$ is a product of three commutators. Further, if R is a division ring with infinite center, then every element in $M_n(R)$ is a product of two commutators. If R is a field and $a\in M_n(R)$, then every element in $M_n(R)$ is a sum of elements of the form $[a,x][a,y]$ with $x,y\in M_n(R)$ if and only if the degree of the minimal polynomial of a is greater than $2$.

An element of a group is called reversible if it is conjugate to its own inverse. Reversible elements are closely related to strongly reversible elements, which can be expressed as a product of two involutions. In this paper, we classify the reversible and strongly reversible elements in the quaternionic special linear group $ \mathrm {SL}(n,\mathbb {H})$ and quaternionic projective linear group $ \mathrm {PSL}(n,\mathbb {H})$. We prove that an element of $ \mathrm {SL}(n,\mathbb {H})$ (resp. $ \mathrm {PSL}(n,\mathbb {H})$) is reversible if and only if it is a product of two skew-involutions (resp. involutions).

The embedding problem of Markov chains examines whether a stochastic matrix$\mathbf{P} $ can arise as the transition matrix from time 0 to time 1 of a continuous-time Markov chain. When the chain is homogeneous, it checks if $ \mathbf{P}=\exp{\mathbf{Q}}$ for a rate matrix $ \mathbf{Q}$ with zero row sums and non-negative off-diagonal elements, called a Markov generator. It is known that a Markov generator may not always exist or be unique. This paper addresses finding $ \mathbf{Q}$, assuming that the process has at most one jump per unit time interval, and focuses on the problem of aligning the conditional one-jump transition matrix from time 0 to time 1 with $ \mathbf{P}$. We derive a formula for this matrix in terms of $ \mathbf{Q}$ and establish that for any $ \mathbf{P}$ with non-zero diagonal entries, a unique $ \mathbf{Q}$, called the ${\unicode{x1D7D9}}$-generator, exists. We compare the ${\unicode{x1D7D9}}$-generator with the one-jump rate matrix from Jarrow, Lando, and Turnbull (1997), showing which is a better approximate Markov generator of $ \mathbf{P}$ in some practical cases.

For a partially specified stochastic matrix, we consider the problem of completing it so as to minimize Kemeny’s constant. We prove that for any partially specified stochastic matrix for which the problem is well defined, there is a minimizing completion that is as sparse as possible. We also find the minimum value of Kemeny’s constant in two special cases: when the diagonal has been specified and when all specified entries lie in a common row.