Related papers: Pattern Forcing (0,1)-Matrices

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

A $d$-dimensional zero-one matrix $A$ avoids another $d$-dimensional zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeroes. Let $f(n,P,d)$ denote the maximum number of ones in a $d$-dimensional…

The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…

Many algorithms use data structures that maintain properties of matrices undergoing some changes. The applications are wide-ranging and include for example matchings, shortest paths, linear programming, semi-definite programming, convex…

We study the problem of computing the $p\rightarrow q$ norm of a matrix $A \in R^{m \times n}$, defined as \[ \|A\|_{p\rightarrow q} ~:=~ \max_{x \,\in\, R^n \setminus \{0\}} \frac{\|Ax\|_q}{\|x\|_p} \] This problem generalizes the spectral…

Let $\mathcal{A}(R,S)$ denote the class of all matrices of zeros and ones with row sum vector $R$ and column sum vector~$S$. We introduce the notion of an inversion in a $(0,1)$--matrix. This definition extends the standard notion of an…

We study the time complexity of computing the $(\min,+)$ matrix product of two $n\times n$ integer matrices in terms of $n$ and the number of monotone subsequences the rows of the first matrix and the columns of the second matrix can be…

Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a…

Checkered patterns are characterized by their square structure and the use of only two distinct colors. These colors are typically represented by two types of numerical sets: {1,0} and {1,-1}. Matrices based on {1,0} may seem identical to…

We classify all strongly real conjugacy classes of the finite unitary group $\U(n, F_q)$ when $q$ is odd. In particular, we show that $g \in \U(n, F_q)$ is strongly real if and only if $g$ is an element of some embedded orthogonal group…

We show that a sufficient condition for the weak limit of a sequence of $W^1_q$-homeomorphisms with finite distortion to be almost everywhere injective for $q \geq n-1$, can be stated by means of composition operators. Applying this result,…

In this paper, we study pattern matching in the set F_{n,k} of fillings of the k x n rectangle with the integers 1,...,kn such that the elements in any column increase from bottom to top. Let P be a column strict tableau of shape 2^k. We…

Gradient descent for matrix factorization exhibits an implicit bias toward approximately low-rank solutions. While existing theories often assume the boundedness of iterates, empirically the bias persists even with unbounded sequences. This…

Let $\mathbb{P}_n$ be the set of all matrices which have the same zero patterns with some permutation matrix of order $n$. In this paper, we prove the following result: Let $\mathbb{I}$ be the unit tensor of order $m\ge3$ and dimension…

Vector embeddings have been tasked with an ever-increasing set of retrieval tasks over the years, with a nascent rise in using them for reasoning, instruction-following, coding, and more. These new benchmarks push embeddings to work for any…

The extremal function $ex(n, P)$ is the maximum possible number of ones in any 0-1 matrix with $n$ rows and $n$ columns that avoids $P$. A 0-1 matrix $P$ is called minimally non-linear if $ex(n, P) = \omega(n)$ but $ex(n, P') = O(n)$ for…

Let $S$ be the multiplicative semigroup of $q\times q$ matrices with positive entries such that every row and every column contains a strictly positive element. Denote by $(X_n)_{n\geq1}$ a sequence of independent identically distributed…

Motivated by the least squares solver Blendenpik, we investigate three strategies for uniform sampling of rows from m x n matrices Q with orthonormal columns. The goal is to determine, with high probability, how many rows are required so…

This paper presents and analyzes the first matrix optimization model which allows general coordinate and spectral constraints. The breadth of problems our model covers is exemplified by a lengthy list of examples from the literature,…

In the area of pattern avoidability the central role is played by special words called Zimin patterns. The symbols of these patterns are treated as variables and the rank of the pattern is its number of variables. Zimin type of a word $x$…