相关论文: Polynomial-Time Algorithms for Weaver's Discrepanc…

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot…

We consider the problem of partitioning $n$ integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen…

In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed {\em n-fold integer programming problems} are polynomial time solvable. Our proof involves two heavy ingredients…

Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor…

Let $p$ be an unknown and arbitrary probability distribution over $[0,1)$. We consider the problem of {\em density estimation}, in which a learning algorithm is given i.i.d. draws from $p$ and must (with high probability) output a…

Given two real vector spaces $U$ and $V$, and a symmetric bilinear map $B: U\times U\to V$, let $Q_B$ be its associated quadratic map $Q_B$. The problems we consider are as follows: (i) are there necessary and sufficient conditions,…

Assume that $$ Au=f,\quad (1) $$ is a solvable linear equation in a Hilbert space, $||A||<\infty$, and $R(A)$ is not closed, so problem (1) is ill-posed. Here $R(A)$ is the range of the linear operator $A$. A DSM (dynamical systems method)…

Recently increasing penetration of renewable energy generation brings challenges for power system operators to perform efficient power generation daily scheduling, due to the intermittent nature of the renewable generation and discrete…

In this work we prove that if $(u_i,v_i)$, $i=1,2$, are smooth enough solutions of the coupled Schr\"odinger-Korteweg-de Vries system \begin{align*} \left. \begin{array}{rl} i u_t+\partial_x^2 u &\hspace{-2mm}=\beta uv - |u|^2 u,\\…

We obtain exact conditions guaranteeing that any global weak solution of the differential inequality $$ \sum_{|\alpha| = m} \partial^\alpha a_\alpha (x, u) \ge g (|u|) \quad \mbox{in } {\mathbb R}^n $$ is trivial, where $m, n \ge 1$ are…

For $\mathrm{H} \in C^2(\mathbb{R}^{N \times n})$ and $u : \Omega \subseteq \mathbb{R}^n \to \mathbb{R}^N$, consider the system \[ \label{1}\mathrm{A}\_\infty u\, :=\,\Big(\mathrm{H}\_P \otimes \mathrm{H}\_P + \mathrm{H}[\mathrm{H}\_P]^\bot…

In the pinwheel problem, one is given an $m$-tuple of positive integers $(a_1, \ldots, a_m)$ and asked whether the integers can be partitioned into $m$ color classes $C_1,\ldots,C_m$ such that every interval of length $a_i$ has non-empty…

According to the Erd\H{o}s discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy…

We consider the fundamental problem of solving quadratic systems of equations in $n$ variables, where $y_i = |\langle \boldsymbol{a}_i, \boldsymbol{x} \rangle|^2$, $i = 1, \ldots, m$ and $\boldsymbol{x} \in \mathbb{R}^n$ is unknown. We…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

Discrimination of unitary operations is fundamental in quantum computation and information. A lot of quantum algorithms including the well-known Deutsch-Jozsa algorithm, Simon's algorithm, and Grover's algorithm can essentially be regarded…

Sequence partition problems arise in many fields, such as sequential data analysis, information transmission, and parallel computing. In this paper, we study the following partition problem variant: given a sequence of $n$ items…

In this paper, we provide a criterion on uniform large deviation principles (ULDP) for stochastic differential equations under locally weak monotone conditions and Lyapunov conditions, which can be applied to stochastic systems with…

We give a polynomial-time algorithm for detecting very long cycles in dense regular graphs. Specifically, we show that, given $\alpha \in (0,1)$, there exists a $c=c(\alpha)$ such that the following holds: there is a polynomial-time…

In this paper, we consider the one time-varying component regularity criteria for local strong solution of 3-D Navier-Stokes equations. Precisely, if $\beta(t)$ is a piecewise $H^1$ unit vector from $[0,T] $ to $\Bbb{S}^2$ with finitely…