Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
0 answers
54 views

How can we tighten the bounds of the $\ell_1$-norm of $\mathbf{A}x$ where $\mathbf{A}\in\mathbb{Z}^{m\times p}$ and $x \in \{0,1\}^p$?

I am curious about the upper bound of $\|\mathbf{A}x\|_1$ where $\mathbf{A}\in\mathbb{Z}^{m\times p}$ and $x \in \{0,1\}^p$, for a specific $\mathbf{A}$ as defined below. I know this is an NP-hard ...
Rhidya Rao's user avatar
0 votes
1 answer
97 views

Numerically bounding a Exponential-Trigonometric Integral [closed]

I am having some trouble with this (undergrad) problem. The Twitter account I found this from was deleted so I unfortunately have not found an answer. I have tried decomposing into Riemann sum and ...
Eftew's user avatar
  • 13
1 vote
0 answers
82 views

Counting the number of local minima of a function that is the sum of square roots of cosines

Suppose you are given a set of functions $f_1, \ldots, f_n$. Every function is defined as follows $$f_i(x) = \sqrt{1+C^2_i-2C_i\cos (x-D_i)}$$ where $0<C_i<1$ and $0\leq D_i<2\pi$ are real-...
loizuf's user avatar
  • 21
2 votes
1 answer
386 views

A maximal inequality

Let $\{X_i\}_{i\in\mathbb{N}}$ be i.i.d. symmetric random variables, with $-1\leq X_i\leq 1$, $\mathbb{E}(X_i) =0$, $\mathbb{E}(X_i^2) = 1$. We have that: $$ P\left(\bigcap_{k = 1}^{n}\frac{|\sum_{i = ...
MathRevenge's user avatar
2 votes
0 answers
80 views

Bound from above and from below the probability that a 1-D centered random walk remains at each step inside a square root boundary

Let $W_n = \sum_{i = 1}^{n}X_i$ be a random walk on $\mathbb{R}$, where the increments $X_i$ are i.i.d., symmetric around the origin ($X\sim -X$), such that $-1\leq |X(\omega)| \leq 1$ $\forall\omega\...
MathRevenge's user avatar
2 votes
0 answers
119 views

Upper and lower bounds on the number of solutions to the equation $\frac{\pi}{4} = \sum_{k=1}^{n} c_{k} \arctan \left(\frac{1}{x_{k}} \right) $

Background The Norwegian mathematician and astronomer Carl Størmer did important work on the equation $$\frac{\pi}{4} = \sum_{k=1}^{n} c_{k} \arctan \left(\frac{1}{x_{k}}\right), \label{1}\tag{1} $$ ...
Max Lonysa Muller's user avatar
1 vote
0 answers
109 views

What is known about the average growth rate of the denominators of $n$ Egyptian fractions summing to one?

Motivation In the following question posted here on MO and over at MSE, user Noah Schweber asks about a weighted count on Egyptian fraction representations (EFRs). To that end, he defines the ...
Max Lonysa Muller's user avatar
0 votes
0 answers
257 views

Is it possible to bound Mertens function $M(n)$ from an inclusion-exclusion formulation?

In this post I proposed a formulation of Mertens function $M(n)$ using the inclusion-exclusion principle, as follows: $$M(n)=-\pi\left(n\right)+\left(\sum_{p_{i}<\sqrt{n}}\pi\left(\lfloor\frac{n}{...
Juan Moreno's user avatar