相关论文: The Structure of Extremal Bad Science Matrices

For a degree 2n real d-dimensional multisequence \beta^(2n) to have a representing measure, it is necessary for the associated moment matrix M(n) to be positive semidefinite and for the algebraic variety V = V(\beta) associated to \beta to…

We compute exact asymptotic results for the probability of the occurrence of large deviations of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we…

We show a simple local norm regularization algorithm that works with high probability. Namely, we prove that if the entries of a $n \times n$ matrix $A$ are i.i.d. symmetrically distributed and have finite second moment, it is enough to…

Given a set $A$ of positive integers $a_1<\cdots<a_k$ and a partition $P: n_1+\cdots+n_k=n$, find the extremal denominators of the regular and semi-regular continued fraction $[0;x_1,\ldots,x_n]$ with partial quotients $x_i\in A$ and where…

In the Determinant Maximization problem, given an $n\times n$ positive semi-definite matrix $\bf{A}$ in $\mathbb{Q}^{n\times n}$ and an integer $k$, we are required to find a $k\times k$ principal submatrix of $\bf{A}$ having the maximum…

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

Let $A$ be an $n\times n$ random matrix whose entries are i.i.d. with mean $0$ and variance $1$. We present a deterministic polynomial time algorithm which, with probability at least $1-2\exp(-\Omega(\epsilon n))$ in the choice of $A$,…

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

Maximum entropy models, motivated by applications in neuron science, are natural generalizations of the $\beta$-model to weighted graphs. Similar to the $\beta$-model, each vertex in maximum entropy models is assigned a potential parameter,…

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

We address the problem of finding worst-case nonparametric bounds for T-statistic by considering the extremal problem of maximising the mid-quantile (a special case of 'smoothed quantile' as discussed in \cite{St77} and \cite{W11}) $\tilde…

Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independent copies of $X$. We show that under mild assumptions on $\|X\|_2$ (a suitable thin-shell bound) and on the tail-decay of the marginals…

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

The sharpest known high probability generalization bounds for uniformly stable algorithms (Feldman, Vondr\'{a}k, 2018, 2019), (Bousquet, Klochkov, Zhivotovskiy, 2020) contain a generally inevitable sampling error term of order…

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…

Jammed (mechanically rigid) polydisperse circular-disk packings in two dimensions (2D) are popular models for structural glass formers. Maximally random jammed (MRJ) states, which are the most disordered packings subject to strict jamming,…

The rank of an $A$-hypergeometric $D$-module $M_A(\beta)$, associated with a full rank $(d\times n)$-matrix $A$ and a vector of parameters $\beta\in \mathbb{C}^d$, is known to be the normalized volume of $A$, denoted $\mathrm{vol}(A)$, when…

The $\gamma_2$ norm of a real $m\times n$ matrix $A$ is the minimum number $t$ such that the column vectors of $A$ are contained in a $0$-centered ellipsoid $E\subseteq\mathbb{R}^m$ which in turn is contained in the hypercube $[-t, t]^m$.…

Let $A$ be an $n\times n$ matrix with mutually independent centered Gaussian entries. Define \begin{align*} \sigma^*:=\max\limits_{i,j\leq n}\sqrt{{\mathbb E}\,|A_{i,j}|^2}, \quad \sigma:=\max\bigg(\max\limits_{j\leq n}\sqrt{{\mathbb…