Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 1516

Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.

3 votes
1 answer
102 views

Separated sets of functions between finite sets

Let $A$ and $B$ be nonempty finite sets of cardinalities $n$ and $m$, respectively. The distance between two functions $f, g : A \to B$ is defined as the number of disagreements between them, that is, …
Jairo Bochi's user avatar
  • 2,479
9 votes
Accepted

Geometric/combinatorial depiction of algebraic identity?

The identity can be rewritten as $(a+b+c)^3=a^3+b^3+c^3+3(a+b)(a+c)(b+c)$ by means of a linear change of variables $a:=(−x+y+z)/2$, etc. Let $T$ be a circle of length $a+b+c$, and let's chop it into …
Jairo Bochi's user avatar
  • 2,479
5 votes
0 answers
241 views

Counting the number of orbits finite groups of "diagonal type"

Let $n$, $k$, $r_1, \dots, r_k$ be positive integers. For each $i \in [k]:=\{1,\dots,k\}$, suppose we are given $n$ permutations of the the set $[r_i]$, that is $f_1^{(i)}, \dots, f_n^{(i)}$ in $\math …
Jairo Bochi's user avatar
  • 2,479
4 votes
0 answers
123 views

A color interpolation lemma

I need the following "color interpolation lemma". Actually I know a way to prove it, but I'm not very satisfied with that proof. Lemma. Let $G=(V,E)$ be a (properly) colored graph with colors $1, …
Jairo Bochi's user avatar
  • 2,479
8 votes
1 answer
227 views

Distribution of entries of a doubly-sorted random matrix

Take an $n \times n$ random matrix whose entries are i.i.d. with uniform distribution in $[0,1]$. Look at the sums of the elements of each row and then permute the rows so that these sums form an incr …
Jairo Bochi's user avatar
  • 2,479