中文
相关论文

相关论文: The Binary Rank of Circulant Block Matrices

200 篇论文

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

群论 · 数学 2009-01-14 Alireza Abdollahi

A \emph{sign pattern (matrix)} is a matrix whose entries are from the set $\{+, -, 0\}$. The \emph{minimum rank} (respectively, \emph{rational minimum rank}) of a sign pattern matrix $\cal A$ is the minimum of the ranks of the real…

组合数学 · 数学 2013-12-24 Guangming Jing , Wei Gao , Yubin Gao , Fei Gong , Zhongshan Li , Yanling Shao , Lihua Zhang

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

信息论 · 计算机科学 2016-08-17 Daniel Salmond , Alex Grant , Ian Grivell , Terence Chan

Block full rank pencils introduced in [Dopico et al., Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems, Linear Algebra Appl., 2020] allow us to obtain local information…

数值分析 · 数学 2020-11-03 Froilán M. Dopico , Silvia Marcaida , María C. Quintana , Paul Van Dooren

Suppose $f(x,y)$ is a binary form of degree $d$ with coefficients in a field $K \subseteq \mathbb C$. The $K$-rank of $f$ is the smallest number of $d$-th powers of linear forms over $K$ of which $f$ is a $K$-linear combination. We prove…

代数几何 · 数学 2016-08-31 Bruce Reznick , Neriman Tokcan

A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a bilinear map (or 3-tensor) is the optimal number of…

信息论 · 计算机科学 2021-03-23 Eimear Byrne , Giuseppe Cotardo

This is part of an ongoing project to find a general algebraic framework for semiring theory. The structure theory of semirings is quite challenging, largely because of the lack of negation, and such basic properties such as unique…

环与代数 · 数学 2026-03-30 Marianne Akian , Stephane Gaubert , Louis Rowen

A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…

泛函分析 · 数学 2009-03-03 D. S. Kaliuzhnyi-Verbovetskyi , I. M. Spitkovsky , H. J. Woerdeman

The problem of finding the maximal dimension of linear or affine subspaces of matrices whose rank is constant, or bounded below, or bounded above, has attracted many mathematicians from the sixties to the present day. The problem has caught…

环与代数 · 数学 2024-12-02 Elena Rubei

An integer matrix $\mathbf{A}$ is $\Delta$-modular if the determinant of each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix of $\mathbf{A}$ has absolute value at most $\Delta$. The study of $\Delta$-modular matrices…

最优化与控制 · 数学 2022-12-08 Joseph Paat , Ingo Stallknecht , Zach Walsh , Luze Xu

In this paper, we consider the problem of computing the rank of a block-structured symbolic matrix (a generic partitioned matrix) $A = (A_{\alpha \beta} x_{\alpha \beta})$, where $A_{\alpha \beta}$ is a $2 \times 2$ matrix over a field…

组合数学 · 数学 2021-06-23 Hiroshi Hirai , Yuni Iwamasa

An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Q_n such that every vector x in Q_n can be obtained from some vector c in C by changing at most R 1's of c to 0's, where R is as small as possible.…

组合数学 · 数学 2007-07-16 Joshua N. Cooper , Robert B. Ellis , Andrew B. Kahng

An interval matrix is a matrix whose entries are intervals in the set of real numbers. Let $p , q $ be nonzero natural numbers and let $\mu =( [m_{i,j}, M_{i,j}])_{i,j}$ be a $p \times q$ interval matrix; given a $p \times q$ matrix $A$…

环与代数 · 数学 2018-03-02 Elena Rubei

Let $B$ be a set of Eulerian subgraphs of a graph $G$. We say $B$ forms a $k$-basis if it is a minimum set that generates the cycle space of $G$, and any edge of $G$ lies in at most $k$ members of $B$. The basis number of a graph $G$,…

组合数学 · 数学 2024-12-25 Saman Bazargani , Therese Biedl , Prosenjit Bose , Anil Maheshwari , Babak Miraftab

Let K be a field of characteristic different from 2 and let V be a vector space of dimension n over K. Let M be a non-zero subspace of symmetric bilinear forms defined on V x V and let r=rank(M) denote the set of different positive integers…

环与代数 · 数学 2018-01-26 Rod Gow

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…

数论 · 数学 2026-05-04 Steven Duplij

A matrix is said to have factor width at most $k$ if it can be written as a sum of positive semidefinite matrices that are non-zero only in a single $k \times k$ principal submatrix. We explore the ``factor-width-$k$ rank'' of a matrix,…

组合数学 · 数学 2025-04-03 Nathaniel Johnston , Shirin Moein , Sarah Plosker

We describe new relations among conformal block divisors in $\operatorname{Pic}(\bar{\operatorname{M}}_{0,n})$. These relations appear from various rank-level dualities of conformal blocks on $\mathbb{P}^1$ with $n$ marked points. We also…

代数几何 · 数学 2015-11-24 Swarnava Mukhopadhyay

Given a graph G, a real orthogonal representation of G is a function from its set of vertices to R^d such that two vertices are mapped to orthogonal vectors if and only if they are not neighbors. The minimum vector rank of a graph is the…

组合数学 · 数学 2013-04-16 Xiaowei Li , Michael Nathanson , Rachel Phillips

We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.

数值分析 · 数学 2007-05-23 Hugo J. Woerdeman