I'm trying to learn about computing the permanents of rectangular matrices, and everywhere I go it seems to say that in order to have a permanent or compute a permanent of a rectangular matrix efficiently, a little confused about which one, the number of rows needs to be less than or equal to the number of columns in the matrix. However, especially in light of the generating function interpretation of permanents I don't see why this has to be, can someone explain this to me please.
2025-01-13 17:28:06.1736789286
(why) does the number of rows in a matrix have to be less than or equal to the number of columns to compute a permanent?
344 Views Asked by Avi Tachna-Fram https://math.techqa.club/user/avi-tachna-fram/detail At
1
There are 1 best solutions below
Related Questions in LINEAR-ALGEBRA
- Proving a set S is linearly dependent or independent
- An identity regarding linear operators and their adjoint between Hilbert spaces
- Show that $f(0)=f(-1)$ is a subspace
- Find the Jordan Normal From of a Matrix $A$
- Show CA=CB iff A=B
- Set of linear transformations which always produce a basis (generalising beyond $\mathbb{R}^2$)
- Linear Algebra minimal Polynomial
- Non-singularity of a matrix
- Finding a subspace such that a bilinear form is an inner product.
- Is the row space of a matrix (order n by m, m < n) of full column rank equal to $\mathbb{R}^m$?
Related Questions in MATRICES
- Show CA=CB iff A=B
- What is the correct chain rule for composite matrix functions?
- Is the row space of a matrix (order n by m, m < n) of full column rank equal to $\mathbb{R}^m$?
- How to show that if two matrices have the same eigenvectors, then they commute?
- Linear Algebra: Let $w=[1,2,3]_{L_1}$. Find the coordinates of w with respect to $L$ directly and by using $P^{-1}$
- How to prove the cyclic property of the trace?
- Matrix expression manipulation
- Matrix subring isomorphic to $\mathbb{C}$
- Is the ellipsoid $x'Qx < \alpha$ equivalent to $\alpha Q^{-1} - x x' \succ 0$?
- Show that matrix $M$ is not orthogonal if it contains column of all ones.
Related Questions in COMPUTER-SCIENCE
- What is the big O when I subtract two sets?
- Can I get multivariable taylor series expansion on wolfram alpha or matlab?
- P is properly contained in DTIME(T'(n)).
- Can $L$ be regular language if it is a union of infinitely many regular languages $L_1,L_2,L_3,...$ over the same alphabet?
- Is there an algorithm for deciding big/little-O queries?
- Is this a good improvement on heaps?
- How to find a line that stabs the maximum possible number of segments?
- Big O proof for logarithmic function
- Graph Theoretic model plan? Combinatorics
- Best sources on complete transforms (classic orthonormal transforms) and overcomplete transforms in signal processing
Related Questions in PERMANENT
- Is there a name for this generalization of the determinant?
- What is the number of $n \times n$ binary matrices $A$ such that $\det(A) = \text{perm}(A)$?
- Show that the number of perfect matches in graph $G$ is equal to $\operatorname{Per}(A)$
- The number of perfect matchings corresponds to the Matrix Permanent
- Prove Per(A)=1 if and only if A is a permutation matrix
- computing Ryser's formula for the permanent
- (why) does the number of rows in a matrix have to be less than or equal to the number of columns to compute a permanent?
- algebraic branching programs and the 3x3 permanent
- Geometric Interpretation of the Permanent
- The permanent of the sum of matrices
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Refuting the Anti-Cantor Cranks
- Find $E[XY|Y+Z=1 ]$
- 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?
- What are the Implications of having VΩ as a model for a theory?
- How do we know that the number $1$ is not equal to the number $-1$?
- Defining a Galois Field based on primitive element versus polynomial?
- Is computer science a branch of mathematics?
- Can't find the relationship between two columns of numbers. Please Help
- 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
- A community project: prove (or disprove) that $\sum_{n\geq 1}\frac{\sin(2^n)}{n}$ is convergent
- Alternative way of expressing a quantied statement with "Some"
Popular # Hahtags
real-analysis
calculus
linear-algebra
probability
abstract-algebra
integration
sequences-and-series
combinatorics
general-topology
matrices
functional-analysis
complex-analysis
geometry
group-theory
algebra-precalculus
probability-theory
ordinary-differential-equations
limits
analysis
number-theory
measure-theory
elementary-number-theory
statistics
multivariable-calculus
functions
derivatives
discrete-mathematics
differential-geometry
inequality
trigonometry
Popular Questions
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- 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)$?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- How to find mean and median from histogram
- Difference between "≈", "≃", and "≅"
- Easy way of memorizing values of sine, cosine, and tangent
- How to calculate the intersection of two planes?
- What does "∈" mean?
- If you roll a fair six sided die twice, what's the probability that you get the same number both times?
- Probability of getting exactly 2 heads in 3 coins tossed with order not important?
- Fourier transform for dummies
- Limit of $(1+ x/n)^n$ when $n$ tends to infinity
The key idea is that for $k=\min(m,n)$, the permanent is the sum of all possible products of $k$ elements, with no two of the $k$ selected elements from any row or column.
Hence, as I noted in my comment, the calculation wouldn't be any different for the transpose, so without loss of generality, we can assume $m\le n$.