Related papers: Generalized low solution of $\mathsf{RT}_k^1$ prob…
Low rank regularization, in essence, involves introducing a low rank or approximately low rank assumption for matrix we aim to learn, which has achieved great success in many fields including machine learning, data mining and computer…
We are concerned with the three dimensional incompressible Navier--Stokes equations driven by an additive stochastic forcing of trace class. First, for every divergence free initial condition in $L^{2}$ we establish existence of infinitely…
We prove higher rank analogues of the Razumov--Stroganov sum rule for the groundstate of the O(1) loop model on a semi-infinite cylinder: we show that a weighted sum of components of the groundstate of the A_{k-1} IRF model yields integers…
We provide conditions ensuring that the KKT-type conditions characterizes the global optimality for quadratically constrained (possibly nonconvex) quadratic programming QCQP problems in Hilbert spaces. The key property is the convexity of a…
We show that most arithmetic circuit lower bounds and relations between lower bounds naturally fit into the representation-theoretic framework suggested by geometric complexity theory (GCT), including: the partial derivatives technique…
We show that the equation $\lambda_1 n_1^2 + ... + \lambda_s n_s^2 = 0$ admits non-trivial solutions in any subset of $[N]$ of density $(\log N)^{-c_s}$, provided that $s \geq 7$ and the coefficients $\lambda_i$ sum to zero and satisfy…
This paper presents a complete classification of minimal graph surfaces that admit graphical transformations into other minimal surfaces. These transformations are functions that map the height function of a minimal graph surface to another…
Consider the KPP-type equation of the form $\Delta u+f(u)=0$, where $f:[0,1] \to \mathbb R_{+}$ is a concave function. We prove for arbitrary dimensions that there is no solution bounded in $(0,1)$. The significance of this result from the…
We first present a useful characterization of additive (stabilizer) quantum error-correcting codes. Then we present several examples of We first present a useful characterization of additive (stabilizer) quantum error--correcting codes.…
We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…
Algebraically general para-K\"ahler Einstein spaces equipped with 3D algebras of infinitesimal symmetries are considered. It is shown that if the algebra contains 2D trivial subalgebra then vacuum Einstein field equations with cosmological…
Let $G\subseteq GL(n)$ be a finite group without pseudo-reflections. We present an algorithm to compute and verify a candidate for the Cox ring of a resolution $X\rightarrow \mathbb{C}^n/G$, which is based just on the geometry of the…
In this paper we utilize a convex integration scheme to construct non-trivial solutions to the stationary KdV equation which lie in $L^p(\mathbb{T})$, $p < 2$. In addition, we demonstrate this result is sharp in the sense that if $u \in…
I show that the general implicit-function problem (or parametrized fixed-point problem) in one complex variable has an explicit series solution given by a trivial generalization of the Lagrange inversion formula. I give versions of this…
We consider the quantum decoding problem. It consists in recovering a codeword given a superposition of noisy versions of this codeword. By measuring the superposition, we get back to the classical decoding problem. It appears for the first…
We consider uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a partial solution for the case in which all resolution classes are either…
We show that a question of Miller and Solomon -- that whether there exists a coloring $c:d^{<\omega}\rightarrow k$ that does not admit a $c$-computable variable word infinite solution, is equivalent to a natural, nontrivial combinatorial…
The infinite pigeonhole principle for 2-partitions ($\mathsf{RT}^1_2$) asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we study the infinite pigeonhole principle from a…
The notion of generic reducibility was introduced by A.Rybalov in his CiE 2018 paper: a set A is generically reducible to set B if there exists a total computable function f that m-reduces A to B such that the f-preimage of every set that…
We study translation-invariant additive equations of the form $\sum_{i=1}^s \lambda_i \mathbf{P}(\mathbf{n}_i) = 0$ in variables $\mathbf{n}_i \in \mathbb{Z}^d$, where the $\lambda_i$ are nonzero integers summing to zero, and $\mathbf{P}$…