Search Results
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 |
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
9
votes
Find the tight upper bound of $\sum_{i=1}^n \frac{i}{i+x_i}$, where the $x_i$'s are distinct...
I doubt that there is an exact formula for this maximum, and unfortunately Wolfgang's guess is incorrect. Indeed, let
$$
a_n = \mathrm{max}_{\sigma \in \mathfrak{S}_n} \sum_{i=1}^n \frac{i}{i + \sigma …
13
votes
Accepted
Integer-valued power sums
The function
$$
f : z \in \mathbb{C} \longmapsto \sum_{i} \frac{a_i}{1-a_iz}
$$
is meromorphic on $\mathbb{C}$ and has integral Taylor coefficients. It follows from a theorem of Borel that such a fun …
7
votes
3
answers
413
views
Covering a (hyper)cube with lines
Let $K_n$ be the sets of vectors $x \in \mathbb{Z}^d $ with each coordinates $x_i$ between $1$ and $n$. For any subset $A$ of $K_n$, let $S(A)$ be the set of points $x \in K_n$ which are on some line …
10
votes
Proof of a combinatorial identity (possibly using trigonometric identities)
Let us compute the ordinary generating function of $k \mapsto c_{n+k,k}$, i.e. $S(X) = \sum_{k \geq 0 } c_{n+k,k} X^k $ (with notations as in Lierre's answer above) :
$$ S(X^2) = \sum_j \sum_k \binom{ …
5
votes
1
answer
201
views
A question on minimal idempotent ultrafilter on N^2
Is there some minimal idempotent ultrafilter $q \in \beta( \mathbb{N}^2)$ (with respect to the law $"+"$) such that any $A \in q$ is a subset of $\mathbb{N} \times \{ 0 \} $ ?
(See for example http: …
2
votes
Given an integer lattice, how to count the number of points whose norm is smaller than some ...
Let $b_1,\dots,b_n$ in $[-M,M]^m$ be linearly independent, and let $L = \sum_i \mathbb{Z}b_i$ be the lattice they generate.
For $i = 1, \dots,n$, let $r_i$ be the smallest positive real number such th …
12
votes
Sets of unit fractions with sum $\leq 1$
Let $R > 1$ and $\lambda \in \mathbb{R}$ be such that
$$
\int_{1}^R \mathrm{tanh}(\frac{\lambda x}{2}) \frac{d x}{x} = \log R -2.
$$
Then standard techniques in large deviation theory yield
$$
\frac{ …
6
votes
Accepted
Meeting a set of spheres in $\mathbb{R}^n$
Let $(S_i)_{i \in I}$ be a family of spheres of cardinality $|I| < \mathfrak{c}$ and let $S$ be a sphere distinct from each $S_i$. Each intersection $S \cap S_i$ is a (possibly degenerate) circle. Sin …
2
votes
Expanding a combinatorial argument involving permutation coefficients
The simplest explanation is that it is a mistake. One can however complete the proof as follows:
If $X$ is large enough then $u(m) \in \{ 0,1,2 \}$ for all $m$ since $e < 3$. Thus the number of disti …
6
votes
Odd permutations $\tau\in S_n$ with $\sum_{k=1}^nk\tau(k)$ an odd square
I assume you have checked this for small $n$, so I will only consider large $n$. I will show: if $n \geq 14$, then there exists a product $\sigma = (i_1 j_1) (i_2 j_2) \dots (i_5 j_5)$ of five transpo …
6
votes
Accepted
Is there a combinatorial interpretation or bijective proof for this Catalan number identity?
There is an obvious bijective proof of the identity
$$ 2 \binom{2n}{n} + 2 \binom{2n}{n + 1} = \binom{2n+2}{n+1}$$
and also a bijective proof of
$$ 2\binom{2n}{n} - 2 \binom{2n}{n+1} = 2C_n,$$
see t …
4
votes
1
answer
696
views
A reference for this possibly well-known fact concerning the Kakeya conjecture?
I believe I have read or heard somewhere that the Kakeya conjecture would follow from appropriate lower bounds for the minimal size of a subset of $\{ 1 , \cdots , N\}$ which contains a translate of e …
5
votes
0
answers
250
views
A question on symmetric functions
Let $0 \leq m \leq n$ be integers. The group $S_n$ of permutations acts on the ring $\mathbb{Z}[X_1,\dots,X_n]$ by permuting the coordinates, with fixed subring $\mathbb{Z}[\sigma_1,\dots,\sigma_n]$, …
3
votes
Square-free sets in $\mathbb F_2^n\oplus\mathbb F_2^n$
Let $d_n$ be the maximal density of a squarefree set in $\mathbb F_2^n\oplus\mathbb F_2^n$. Then it is unknown whether there exists a constant $c < 1$ such that $d_n = O(c^n)$. Indeed, such a result w …
8
votes
Accepted
Prove a family of series having integer coefficients
Yes. The coefficient of $x^n$ in $F_r$ is the $2n$-th derivative at $t = 0$ of the function
$$
t \mapsto (\cos t)^{r} = \frac{1}{2^r} \sum_{k=0}^r \binom{r}{k} e^{it(2k-r)}.
$$
But the successive deri …