Related papers: Matrix Theory for Minimal Trellises

The influence-matrix formalism provides an alternative route to the classical simulation of quantum dynamics. Because influence matrices retain information only about the effective bath seen by local observables, they are expected to be…

We provide a characterisation of when a single-element contraction of a transversal matroid is itself transversal. Using this characterisation, we define a new class of transversal matroids closed under minors, which we call path-circular…

The classical approach to the study of dynamical systems consists in representing the dynamics of the system in the form of a "source-sink", that means identifying an attractor-repeller pair, which are attractor-repellent sets for all other…

The identification of repeating patterns in discrete grids is rudimentary within symbolic reasoning, algorithm synthesis and structural optimization across diverse computational domains. Although statistical approaches targeting noisy data…

We introduce and study the permanence properties of the class of linear transfers between probability measures. This class contains all cost minimizing mass transports, but also martingale mass transports, the Schrodinger bridge associated…

In this paper, a hierarchical Tucker low-rank (HTLR) matrix is proposed to approximate non-oscillatory kernel functions in linear complexity. The HTLR matrix is based on the hierarchical matrix, with the low-rank blocks replaced by Tucker…

We prove, without set theoretic assumptions, that every locally presentable category C endowed with a tractable cofibrantly generated class of cofibrations has a unique minimal (or left induced) Quillen model structure. More generally, for…

We consider a notion of probabilistic rank and probabilistic sign-rank of a matrix, which measures the extent to which a matrix can be probabilistically represented by low-rank matrices. We demonstrate several connections with matrix…

We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…

Abstract spin chains axiomatize the structure of local observables on the 1D lattice which are invariant under a global symmetry, and arise at the physical boundary of 2+1D topologically ordered spin systems. In this paper, we study tensor…

We derive a fully explicit version of the Selberg trace formula for twist-minimal Maass forms of weight 0 and arbitrary conductor and nebentypus character, and apply it to prove two theorems. First, conditional on Artin's conjecture, we…

A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…

This work is the second of a series of papers devoted to revisiting the properties of Heterotic string compactifications on ALE spaces. In this project we study the geometric counterpart in F-theory of the T-dualities between Heterotic ALE…

This paper studies the low-rank property of the inverse of a class of large-scale structured matrices in the tensor-train (TT) format, which is typically discretized from differential operators. An interesting question that we are concerned…

In this paper we propose a Kronecker-based modeling for identifying the spatial-temporal dynamics of large sensor arrays. The class of Kronecker networks is defined for which we formulate a Vector Autoregressive model. Its…

We study the symplectic reduction of the phase space of two twistors to the cotangent bundle of the Lorentz group. We provide expressions for the Lorentz generators and group elements in terms of the spinors defining the twistors. We use…

The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…

Motivated by the behavior of the trace pairing over tame cyclic number fields, we introduce the notion of tame lattices. Given an arbitrary non-trivial lattice $\mathcal{L}$ we construct a parametric family of full-rank sub-lattices…

This work analyzes singular-value spectra of weight matrices in pretrained transformer models to understand how information is stored at both ends of the spectrum. Using Random Matrix Theory (RMT) as a zero information hypothesis, we…

We present a minimal mathematical model for conducting patterns that separates geometric trajectory from temporal parametrization. The model is based on a cyclic sequence of preparation and ictus points connected by cubic Hermite segments…