Skip to main content

Questions tagged [algebraic-combinatorics]

For problems involving algebraic methods in combinatorics (especially group theory and representation theory) as well as combinatorial methods in abstract algebra.

0 votes
1 answer
57 views

Show that a matroid $M$ is connected iff, for every pair of distinct elements of $E(M),$ there is a hyperplane avoiding both.

Here is the question I am thinking about: Show that a matroid $M$ is connected iff, for every pair of distinct elements of $E(M),$ there is a hyperplane avoiding both. It is in James Oxley book in ...
Intuition's user avatar
  • 3,139
1 vote
1 answer
167 views

circuit and a cocircuit can not have an odd number of common elements.

Here is the question I am trying to solve: Show that, in a binary matroid, a circuit and a cocircuit can not have an odd number of common elements. Here are the required definitions: A binary matroid ...
user avatar
1 vote
1 answer
112 views

If $X \subseteq Y$ and $r(X) = r(Y),$ then $cl(X) = cl(Y).$

Here is the question I am trying to understand its solution: Let $M$ be a matroid, and $r$ and $cl$ be its rank function and its closure operator. Prove the following: $(e)$ If $X \subseteq Y$ and $r(...
Emptymind's user avatar
  • 2,087
1 vote
0 answers
64 views

Proving that $r(cl(X) \cup cl(Y)) = r(cl(X \cup Y))$.

Here is the question I am trying to prove: Let $M$ be a matroid, and $r$ and $cl$ be its rank function and its closure operator. Prove the following: $(d)$ $r(X \cup Y) = r(X \cup cl(Y)) = r(cl(X) \...
Emptymind's user avatar
  • 2,087
1 vote
1 answer
89 views

proving that $r(X \cup cl(Y)) = r(cl(X) \cup cl(Y)).$

Here is the question I am trying to prove: Let $M$ be a matroid, and $r$ and $cl$ be its rank function and its closure operator. Prove the following: $(d)$ $r(X \cup Y) = r(X \cup cl(Y)) = r(cl(X) \...
Emptymind's user avatar
  • 2,087
0 votes
1 answer
92 views

proving that $r(X \cup Y) = r(X \cup cl(Y)).$

Here is the question I am trying to prove: Let $M$ be a matroid, and $r$ and $cl$ be its rank function and its closure operator. Prove the following: $(d)$ $r(X \cup Y) = r(X \cup cl(Y)) = r(cl(X) \...
Emptymind's user avatar
  • 2,087
1 vote
1 answer
123 views

Constructing a basis for a matroid with a circuit in it.

Here is the question I am trying to solve (Matroid Theory, second edition by Martin Oxley, Chapter 1, section 2): Prove that if $C$ is a circuit of a matroid $M$ and $e \in C,$ then $M$ has a basis $B$...
Emptymind's user avatar
  • 2,087
0 votes
1 answer
110 views

The intersection of all of the flats containing $X$ equals $cl(X).$

Here is the question I am trying to solve (Matroid Theory, Second edition, Chapter 1, section 4 ): Let $M$ be a matroid, and $r$ and $cl$ be its rank function and its closure operator. Prove the ...
Emptymind's user avatar
  • 2,087
2 votes
1 answer
69 views

Sum of squares of chromatic roots of a bipartite graph

Given a graph $G = (V, E)$, we can calculate its chromatic polynomial $P(G, k)$, and it has $n$ (complex) roots, also known as chromatic roots. It is a well-known fact that the sum of chromatic roots ...
hedgehog0's user avatar
0 votes
1 answer
41 views

Characterizing paving matroids in terms of their bases.

Here is the question I am trying to solve: Characterize paving matroids in terms of their collections of independent sets and in terms of their collection of bases. What exactly does it mean to ...
Emptymind's user avatar
  • 2,087
0 votes
0 answers
38 views

Are there Plucker-like relations for the tensor product of two decomposable differential forms?

Let $V$ be a $k$-dimensional vector space, and consider a decomposable tensor in $\bigwedge^\ell V \otimes \bigwedge^m V$ having the form $$ \mathbf{v} \otimes \mathbf{w} := v_1 \wedge \cdots \wedge ...
WQE's user avatar
  • 127
6 votes
1 answer
102 views

A Question on the Pedagogical Logic Behind the Order of Two Given Exercises

In Lang's Algebra, the following two exercises are presented to the reader in the following order: Groups Exercise 15: Let $G$ be a finite group acting on $S$, a finite set of at least $2$ elements. ...
wbitting95's user avatar
1 vote
0 answers
28 views

Subtracting four numbers in cycles

Arbitrarily give four positive numbers, assuming $A_1, B_1, C_1, D_1$; In $A_1$ and $B_1$, subtract the smaller from the larger (0 if equal), and the result is $A_2$; In $B_1$ and $C_1$, subtract the ...
tianzhidaosunyouyu's user avatar
0 votes
3 answers
100 views

Why is this probability > 1?

I'm going to blow my brains out. I have 27 cards of red, blue and green cards. There is 9 of each color. I draw 12 cards. What is the probability that I have AT LEAST 6 blues, AT LEAST 1 red and AT ...
Fares Mohamed's user avatar
4 votes
1 answer
132 views

Is there a $q$-analog for the product of binomial coefficients?

The $q$-analog of the binomial coefficient $\binom{n}{k}$ may be defined as the coefficient of $x^k$ in $\prod_{i=0}^{n-1}(1+q^ix)$. Classical arithmetic identities tend to have $q$-analogs. I am ...
Alvaro Martinez's user avatar

15 30 50 per page
1 2 3
4
5
18