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 |
14
votes
1
answer
1k
views
Berry Esseen type result for probability density functions
Let $X_1, X_2, \cdots$ be i.i.d. random variables with $E(X_1) = 0, E(X_1^2) = \sigma^2 >0, E(|X_1|^3) = \rho < \infty$.
Let $Y_n = \frac{1}{n} \sum_{i=1}^n X_i$ and let us note $F_n$ (resp. $\Phi$) t …
44
votes
4
answers
5k
views
Why is "P vs. NP" necessarily relevant?
I want to start out by giving two examples:
Graham's problem is to decide whether a given edge-coloring (with two colors) of the complete graph on vertices $\lbrace-1,+1\rbrace^n$ contains a planar $ …
20
votes
3
answers
4k
views
Propositions equivalent to the completeness of the real numbers
Can anyone point me to a reasonably comprehensive article (or book chapter) explaining which basic theorems of calculus are equivalent to the completeness axiom of the reals and which ones aren't?
He …
13
votes
3
answers
1k
views
Efficient visibility blockers in Pólya's orchard problem
Pólya's orchard problem asks for which radius $\rho$ of trees at each lattice point within a distance $R$ of the origin block all lines of sight to the exterior of the orchard.
It has been …
2
votes
2
answers
440
views
Nested De Bruijn sequences
A binary De Bruijn sequence of index $n$ is a circular sequence $S=a_1 a_2 \dots a_{2^n},$ with $a_i \in \{0,1\},$ and such that each of the $2^n$ binary $n$-uples occurs exactly once in $S.$
Is ther …
23
votes
10
answers
5k
views
Completeness vs Compactness in logic
One standard approach to showing compactness of first-order logic is to show completeness, of which compactness is an easy corollary. I am told this approach is deprecated nowadays, as Compactness is …
80
votes
6
answers
6k
views
whence commutative diagrams?
It seems that commutative diagrams appeared sometime in the late 1940s -- for example, Eilenberg-McLane (1943) group cohomology paper does not have any, while the 1953 Hochschild-Serre paper does. Doe …
15
votes
3
answers
4k
views
How to place k bishops on an nxn chessboard
In how many different ways can k bishops be placed on an nxn chessboard such that no two bishops attack each other? Please try to respond with a formula and explanation.
14
votes
2
answers
1k
views
Relation between holonomic D-modules and perverse sheaves
Given a smooth complex algebraic variety, the Riemann-Hilbert-correspondence tells us, that the category of perverse sheaves is equivalent to the category of regular, holonomic D-modules.
However not …
2
votes
5
answers
536
views
A good introduction to the study of the Thue Equation
Hi,
I am interested in studying the Thue equation, where we are concerned with a binary form $F(x,y) = a_0 x^r + a_1 x^{r-1}y + \cdots + a_r y^r$ and solutions of the form
$$F(x,y) = h$$
for some in …
0
votes
0
answers
330
views
Can KL divergence go to 0, but $E[\log(p/q)^2]$ diverge in certain cases?
Let $p(x)$ be a fixed distribution over a discrete space.
Let $A, C > 0$ be constants.
Let $\epsilon > 0$. Can we find an example of a distribution
$q_{\epsilon}$ such that $\mathrm{KL}(p||q_{\epsilo …
2
votes
1
answer
291
views
Why are graph embeddings defined the way they are?
In my recent question I asked about a proof for the fact that the dual of a dual graph embedding is equal to the original graph. Thinking about this a little more leads me to wonder why graph imbeddin …
3
votes
1
answer
1k
views
Higher Chow groups and singular cohomology theory
Let $X$ be a regular scheme over a field $k$ and $Δ^m$ be the algebraic $m$-simplex $\mathrm{Spec}\, k[t_0,...,t_m]/(1-\sum_jt_j)$. The group $z^i(X,m)$ is the free abelian group generated by all clos …
8
votes
1
answer
526
views
Theory of addition and a predicate that recognizes powers of 2
What is the complexity of the theory of addition (Presburger arithmetic) augmented by a unary predicate that recognizes powers of 2?
5
votes
1
answer
283
views
Connected graphs that are not 2 connected
In the great book by Harary and Palmer (Graphical Enumeration) one can find many interesting things about graph asymptotics.
For example it is stated that the number of all unlabeled graph is $\sim …