Consider a matrix with entries in $\{0,1\}$. The matrix is of dimension $R\times N$, where $R$ should be viewed as much larger than $N$. Each row of this matrix has exactly $N/2$ ones and the rest are zeros. Each row of the matrix is distinct. The question is, what is the largest number of $R$ such that we can still guarantee that the matrix has row rank less than $K$? We always assume $N$ is an even number, and consider $1\leq K\leq N/2$.
2026-03-27 10:44:07.1774608247
Largest matrix satisfying a rank constraint
76 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LINEAR-ALGEBRA
- An underdetermined system derived for rotated coordinate system
- How to prove the following equality with matrix norm?
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Why the derivative of $T(\gamma(s))$ is $T$ if this composition is not a linear transformation?
- Why is necessary ask $F$ to be infinite in order to obtain: $ f(v)=0$ for all $ f\in V^* \implies v=0 $
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Summation in subsets
- $C=AB-BA$. If $CA=AC$, then $C$ is not invertible.
- Basis of span in $R^4$
- Prove if A is regular skew symmetric, I+A is regular (with obstacles)
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in EXTREMAL-COMBINATORICS
- Given N sets of partitions, find a partition such that it satisfies a criterion
- A Combinatorial Geometry Problem With A Solution Using Extremal Principle
- Trying to compute a limit for the Turán number
- Problem 2.2 from Jukna's "Extremal Combinatorics"
- Combinations help please
- Given a graph with n vertices, if it have more than $\frac{nt}{2}$ edges then there exists a simple path of length $t+1$.
- Number of steps the path-avoiding snail must take before a step size of $(2n - 1)/2^k$?
- Upper bound on cumulative power of system of limitedly intersecting subsets?
- Extremal combinatorics problem on graph matching
- Smallest $r$ for which there is an $r$-coloring of the grid wherein no two colors are adjacent more than once.
Related Questions in EXTREMAL-GRAPH-THEORY
- Maximum Number of Edges in a Graph Without a Cycle of length $4$
- $6$-regular graph of order $25$ and diameter $2$
- Given a graph with n vertices, if it have more than $\frac{nt}{2}$ edges then there exists a simple path of length $t+1$.
- Extremal combinatorics problem on graph matching
- How sparse is a graph of bounded treewidth?
- Extremal graph without cycle length $k$ or longer.
- projecting antichains to middlemost levels
- Extremal graphs definition
- Lower bound for the Ramsey number $R(3,t)$
- Help with induction for graph with no path of length $k$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Lemma: If $1\leq S\leq n+1$ then there is a 0-1 matrix $A_{S\times 2n}$ with rank $S$ such that each row of this matrix has exactly $n$ ones.
So if $R=K+1$, where $1\leq K\leq n$, then there is a 0-1 matrix $A_{K+1\times 2n}$ with rank $K+1$ such that each row of this matrix has exactly $n$ ones. So the maximum $R$ such that we can still guarantee that the matrix has row rank less or equal to is $K$.
Proof of the Lemma: If we construct a 0-1 matrix $B_{n+1\times 2n}$ such that
then we can choose any $S$ rows of $B$ to form $A_{S\times 2n}$ described in the lemma above.
Now we proceed with the construction of such $B_{n+1\times 2n}$ by induction on $n$.
If $n=1$, let $B_{2\times 2}$ be the identity matrix.
Assume we have constructed $B_{k+1\times 2k}$ satisfying 1 and 2. Define $$B'_{(k+2)\times (2k+2)}=\begin{pmatrix}B_{k+1\times 2k} & C_{2\times 2}\\ D_{1\times 2k} & E_{1\times 2} \end{pmatrix},$$ where $C_{2\times 2}=\begin{pmatrix}1 & 0\\1 & 0\end{pmatrix}$, $E_{1\times 2}=\begin{pmatrix}0 & 1\end{pmatrix}$ and $D_{1\times 2k}$ is any row vector with $k$ ones and the rest are zeros.
Now, the first $k+1$ rows of $B'$ are linearly independent since $B$ has rank $k+1$.
In addition, the last row of $B'$ does not belong to the span of the first $k+1$ rows, since the last entries of the first $k+1$ rows are zero and last entry of the last row is not zero.
So $B'$ has rank $k+2$.
By construction each row of $B'$ has $k+1$ ones and the rest are zeros. $\square$