English
Related papers

Related papers: Non-overlapping matrices

200 papers

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

Probability · Mathematics 2011-10-28 Miguel Abadi , Rodrigo Lambert

An n\times n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k\ne \ell we have M_{k,\ell} M_{\ell,k} = 0. Dietzfelbinger, Hromkovi\v{c}, and Schnitger (1996) showed that n \le (\rk…

Combinatorics · Mathematics 2013-05-14 Mirjam Friesen , Dirk Oliver Theis

We describe a way to complete a correlation matrix that is not fully specified. Such matrices often arise in financial applications when the number of stochastic variables becomes large or when several smaller models are combined in a…

Mathematical Finance · Quantitative Finance 2021-11-25 Olaf Dreyer , Horst Köhler , Thomas Streuer

The universality hypothesis for quark and lepton mixing matrices (CKM and MNS) is further developed. This hypothesis explains why the CKM is almost diagonal whereas the MNS is almost maximally mixed. If this hypothesis is true, the Dirac CP…

High Energy Physics - Phenomenology · Physics 2014-06-19 Takeshi Fukuyama , Hiroyuki Nishiura

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

Number Theory · Mathematics 2022-06-22 Sergiy Koshkin

We propose and investigate a bi-infinite matrix approach to the multiplication and composition of formal Laurent series. We generalize the concept of Riordan matrix to this bi-infinite context, obtaining matrices that are not necessarily…

Group Theory · Mathematics 2025-04-11 Luis Felipe Prieto-Martínez , Javier Rico

We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…

Combinatorics · Mathematics 2008-02-28 Marni Mishna

We construct a new bijection between the set of $n\times k$ $0$-$1$ matrices with no three $1$'s forming a $\Gamma$ configuration and the set of $(n,k)$-Callan sequences, a simple structure counted by poly-Bernoulli numbers. We give two…

Combinatorics · Mathematics 2019-11-28 Beáta Bényi , Gábor V. Nagy

We show that a formal power series in $2N$ non-commuting indeterminates is a positive non-commutative kernel if and only if the kernel on $N$-tuples of matrices of any size obtained from this series by matrix substitution is positive. We…

Functional Analysis · Mathematics 2007-05-23 Dmitry S. Kalyuzhny\uı-Verbovetzki\uı , Victor Vinnikov

Let the columns of a $p \times q$ matrix $M$ over any ring be partitioned into $n$ blocks, $M = [M_1, ..., M_n]$. If no $p \times p$ submatrix of $M$ with columns from distinct blocks $M_i$ is invertible, then there is an invertible $p…

Combinatorics · Mathematics 2011-03-09 Stephan Foldes , Erkko Lehtonen

We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular,…

Data Structures and Algorithms · Computer Science 2007-05-23 Benjamin Doerr , Tobias Friedrich , Christian Klein , Ralf Osbild

We show that the set of entries generated by any finite set of doubly stochastic matrices is nowhere dense, in contrast to the cases of stochastic matrices or unitary matrices. In other words, there is no finite universal set of doubly…

Functional Analysis · Mathematics 2021-04-02 Wei Zhan

Generalized Pascal matrix whose elements are generalized binomial coefficients is included in the group of generalized Riordan arrays. There is a special set of generalized Riordan arrays defined by parameter $q$. If $q=0$, they are…

Combinatorics · Mathematics 2016-12-23 E. Burlachenko

In the monomer-polymer model, a linear rigid polymer covers $k$ adjacent lattice sites, with no lattice site occupied by more than one polymer. The polymers are called $k$-mers, and those unoccupied lattice sites are called monomers. The…

Combinatorics · Mathematics 2026-05-19 Yong Kong

Using the approach suggested in [arXiv:1002.2761] we present below a sufficient condition guaranteeing that two collections of patterns of permutations have the same exponential generating functions for the number of permutations avoiding…

Combinatorics · Mathematics 2017-02-16 Anton Khoroshkin , Boris Shapiro

Defining the biperiodic Fibonacci words as a class of words over the alphabet $\{0,1\}$, and two specializations the $k-$Fibonacci and classical Fibonacci words, we provide a self-similar decomposition of these words into overlapping words…

Combinatorics · Mathematics 2022-05-12 Darby Bortz , Nicholas Cummings , Suyi Gao , Elias Jaffe , Lan Mai , Benjamin Steinhurst , Pauline Tillotson

We say that two elements of a group or semigroup are $\Bbbk$-linear conjugates if their images under any linear representation over $\Bbbk$ are conjugate matrices. In this paper we characterize $\Bbbk$-linear conjugacy for finite semigroups…

Representation Theory · Mathematics 2019-11-13 Benjamin Steinberg

Positive bi-linear maps between matrix algebras play important roles to detect tri-partite entanglement by the duality between bi-linear maps and tri-tensor products. We exhibit indecomposable positive bi-linear maps between $2\times 2$…

Functional Analysis · Mathematics 2017-09-21 Seung-Hyeok Kye

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…

Quantum Physics · Physics 2009-11-13 D. Gross , K. Audenaert , J. Eisert

Harmonic frames of prime order are investigated. The primary focus is the enumeration of inequivalent harmonic frames, with the exact number given by a recursive formula. The key to this result is a one-to-one correspondence developed…

Rings and Algebras · Mathematics 2012-09-04 Matthew J. Hirn