English
Related papers

Related papers: Non-Expansive Matrix Based number Systems

200 papers

This work examines various statistical distributions in connection with random Vandermonde matrices and their extension to $d$--dimensional phase distributions. Upper and lower bound asymptotics for the maximum singular value are found to…

Probability · Mathematics 2012-11-19 Gabriel H. Tucci , Philip A. Whiting

Two numerical algorithms are proposed for computing an interval matrix containing the matrix gamma function. In 2014, the author presented algorithms for enclosing all the eigenvalues and basis of invariant subspaces of $A \in \mathbb{C}^{n…

Numerical Analysis · Mathematics 2020-01-22 Shinya Miyajima

We study the formula complexity of Iterated Sub-Permutation Matrix Multiplication, the logspace-complete problem of computing the product of $k$ $n$-by-$n$ Boolean matrices with at most a single $1$ in each row and column. For all $d \le…

Computational Complexity · Computer Science 2024-06-25 Benjamin Rossman

We present matrix identities which yield respectively the Jordan canonical form of the Pascal matrix P_n = (i -1 choose j -1)_{1 <= i,j <= n} modulo a prime, the eigenvectors of (i choose j)_{1 <= i,j <= n}, and the Smith normal form of…

Combinatorics · Mathematics 2007-05-23 David Callan

An accidental degeneracy of resonances gives rise to a double pole in the scattering matrix, a double zero in the Jost function and a Jordan chain of length two of generalized Gamow-Jordan eigenfunctions of the radial Schroedinger equation.…

Quantum Physics · Physics 2009-02-05 E. Hernandez , A. Jauregui , A. Mondragon

The optimal branch number of MDS matrices makes them a preferred choice for designing diffusion layers in many block ciphers and hash functions. However, in lightweight cryptography, Near-MDS (NMDS) matrices with sub-optimal branch numbers…

Cryptography and Security · Computer Science 2023-08-15 Kishan Chand Gupta , Sumit Kumar Pandey , Susanta Samanta

A complete description of 4-by-4 matrices $\begin{bmatrix}\alpha I & C \\D & \beta I\end{bmatrix}$, with scalar 2-by-2 diagonal blocks, for which the numerical range is the convex hull of two non-concentric ellipses is given. This result is…

Functional Analysis · Mathematics 2020-09-02 Titas Geryba , Ilya M. Spitkovsky

Let $f$ be a convergent power series of $n$ variables having an isolated singularity at 0. For a rational number $\alpha$, setting $(X,0)=({\mathbb C}^n,0)$, we show that the length of the ${\mathcal D}_X$-module ${\mathcal D}_Xf^{-\alpha}$…

Algebraic Geometry · Mathematics 2024-07-17 Morihiko Saito

We introduce some basic notions and results for quaternionic linear operators analogous to those for complex linear operators. Our main result is to prove the additive and multiplicative Jordan-Chevalley decompositions for quaternionic…

Rings and Algebras · Mathematics 2019-06-06 Han Gang , Yu Jing , Sun Zheyu

Considering a two-by-two block operator matrix system of Maxwell type, we present an elementary way of deducing exponential stability under minimal smoothness (and boundedness) requirements of the underlying domains when applications are…

Analysis of PDEs · Mathematics 2026-03-13 Marcus Waurick

When we deal with a matroid ${\mathcal M}=(U,{\mathcal I})$, we usually assume that it is implicitly given by means of the independence (IND) oracle. Time complexity of many existing algorithms is polynomially bounded with respect to $|U|$…

Data Structures and Algorithms · Computer Science 2025-09-15 Yuki Nishimura , Kazuya Haraguchi

We construct positional numeral systems that work natively over nonderived polyadic $\left( m,n\right) $-rings whose addition takes $m$ arguments and multiplication takes $n$. In such rings, the length of an admissible additive word and a…

Number Theory · Mathematics 2026-05-04 Steven Duplij

In a Note added in proof to a 1984 paper, Daniel A. Marcus claimed to have a counterexample to his conjecture that a minimal positively k-spanning vector configuration in R^m has size at most 2km. However, the counterexample was never…

Metric Geometry · Mathematics 2009-08-13 Ronald F. Wotzlaw , Günter M. Ziegler

We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed…

Information Theory · Computer Science 2014-01-17 Son Hoang Dau , Wentu Song , Chau Yuen

We propose an information-theoretic framework for matrix completion. The theory goes beyond the low-rank structure and applies to general matrices of "low description complexity". Specifically, we consider $m\times n$ random matrices…

Information Theory · Computer Science 2016-08-11 Erwin Riegler , David Stotz , Helmut Bölcskei

Let $M_n$ be the algebra of $n \times n$ complex matrices and $\mathcal{T}_n \subseteq M_n$ the corresponding upper-triangular subalgebra. In their influential work, Petek and \v{S}emrl characterize Jordan automorphisms of $M_n$ and…

Rings and Algebras · Mathematics 2025-03-19 Ilja Gogić , Mateo Tomašević

In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…

Computational Geometry · Computer Science 2025-09-30 Helmut Alt , Sergio Cabello , Otfried Cheong , Ji-won Park , Nadja Seiferth

Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at…

Optimization and Control · Mathematics 2010-10-07 Gennadiy Averkov , Robert Weismantel

Let $G$ be a finite abeilian group. A sequence $S$ with terms from $G$ is zero-sum if the sum of terms in $S$ equals zero. It is a minimal zero-sum sequence if no proper, nontrivial subsequence is zero-sum. The maximal length of a minimal…

Number Theory · Mathematics 2008-01-25 Weidong Gao , Alfred Geroldinger , David J. Grynkiewicz

For an arbitrary representation $\rho$ of a complex finite-dimensional Lie algebra, we construct a collection of numbers that we call the Jordan-Kronecker invariants of $\rho$. Among other interesting properties, these numbers provide lower…

Representation Theory · Mathematics 2019-12-02 Alexey Bolsinov , Anton Izosimov , Ivan Kozlov
‹ Prev 1 8 9 10 Next ›