Tagged Questions

2
votes
0answers
58 views

Extending the vertex-facet correspondence from Δ to Θ

Recall that in the $n$-simplex $\Delta[n]$, we have a combinatorially crucial bijection between facets, (codimension $1$ faces) and vertices, where the $i$th face of a simplex corr …
0
votes
0answers
34 views

Van Den Berg-Kesten-Reimer inequality

Statement of Van Den Berg-Kesten-Reimer inequality: Let $n$ be a positive integer. For $i\in[n]$, let $\mu_i$ be a probability measure on a finite set $\Omega_i$. Let $\Omega=\Ome …
5
votes
1answer
436 views

Duality of eta product identities: a new idea?

Looking at the collection of Eta Function Product Identities by Michael Somos, it seems like generally those identities come in pairs: let's call two eta product identities $\sum\ …
1
vote
0answers
343 views
+150

A problem in number theorem with a number of the base p

First we define a function $f(x,p)$, with $x$ a natural number and with $p$ a prime number. $f(x,p)$ stands for the location where the digit "$p-1$" first appears in the base-$p$ …
1
vote
1answer
49 views

Homomorphism into Kneser graphs $KG(n, k)$

Is there a characterization of graphs $G$ such that $\exists$ $\phi : G \rightarrow KG(n,k)$, where $KG(n,k)$ is the Kneser graph ($k \leq \lceil \frac{n}{2}\rceil $). Any refe …
5
votes
2answers
338 views

expected number of overlapping edges from k cycles in a graph

Consider a minimally connected graph (i.e., a spanning tree) on $n$ nodes, $\mathcal{T}=(\mathcal{V},\mathcal{E}_{\tau})$, and its complement $\overline{\mathcal{T}}=(\mathcal{V}, …
8
votes
1answer
411 views

Connected graded involutive bialgebras (Hopf algebras) sought (for Dynkin idempotent checking)

Again, there is a general and a concrete question: Concrete question. Let $H$ be a connected graded bialgebra over a commutative ring $k$ with unity (where graded means $\mathbb N …
9
votes
0answers
256 views

Möbius Randomness of the Rudin-Shapiro Sequence

The Rudin-Shapiro sequence (also known as the Golay-Rudin-Shapiro sequence) is defined as follows. Let $a_n = \sum \epsilon_i\epsilon_{i+1}$ where $\epsilon_1,\epsilon_2,\dots$ ar …
1
vote
2answers
107 views

Converting a recursive definition to an explicit one

Is there an explicit form for $a_x$ (whole numbers x) given that $a_x = \displaystyle\sum_{i=1}^{x-1} \binom{x-1}{i} a_i$? I've listed out the first few terms: for $x=0,1,2,3,4,5 …
6
votes
3answers
363 views

Not quite regular polyhedra

Take a naive interpretation of regular polyhedra: All vertices (including epsilon ball) congruent All edges congruent All faces congruent We can now find interesting families b …
0
votes
1answer
133 views

Probabilty of two permutations having common elements?

What is the probability of two permutations on set X of size m (i.e. |X|=m) having at least n points of intersection? By this I mean that if two permutations, which I'll call g(x) …
0
votes
1answer
190 views

Graph Theory - Connectivity of r-regular graphs

Hello everyone. I'm really struggling with this question. All help appreciated. Find the minimum positive integer r for which there exists an r-regular graph G such that λ(G) ≥ κ( …
31
votes
2answers
3k views

Walsh Fourier Transform of the Möbius function

This question is related to this previous question where I asked about ordinary Fourier coefficients. Special case: is Möbius nearly Orthogonal to Morse ! Harold Calvin Marsto …
21
votes
0answers
531 views
+550

vector balancing problem

This problem may be hard, so I don't expect an off-the-cuff solution. But can anyone suggest possible proof strategies? I have vectors $v_1, \ldots, v_k$ in ${\bf R}^n$. Each of t …
9
votes
18answers
5k views

Good combinatorics textbooks for teaching undergraduates?

Hello, can anyone recommend good combinatorics textbooks for undergraduates? I will be teaching a 10-week course on the subject at Stanford, and I assume that the students will be …

1 2 3 4 5 111 next
15 30 50 per page