Related papers: KRW Composition Theorems via Lifting
Proving that there are problems in $\mathsf{P}^\mathsf{NP}$ that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only…
Taking into account the global one-dimensionality conjecture recently proposed by the author, the Cauchy-like analytical wave functional of the Wheeler-DeWitt theory is derived. The crucial point of the integration strategy is canceling of…
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…
Kenyon and Wilson showed how to test if a circular planar electrical network with $n$ nodes is well-connected by checking the positivity of $\binom{n}{2}$ central minors of the response matrix. Their test is based on the fact that any…
For a finite word $w$ we define and study the Kolmogorov structure function $h_w$ for nondeterministic automatic complexity. We prove upper bounds on $h_w$ that appear to be quite sharp, based on numerical evidence.
We propose a framework for verifiable and compositional reinforcement learning (RL) in which a collection of RL subsystems, each of which learns to accomplish a separate subtask, are composed to achieve an overall task. The framework…
Several classes of DNR functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of…
The K{\L}R conjecture of Kohayakawa, {\L}uczak, and R\"odl is a statement that allows one to prove that asymptotically almost surely all subgraphs of the random graph G_{n,p}, for sufficiently large p : = p(n), satisfy an embedding lemma…
In studying the expressiveness of neural networks, an important question is whether there are functions which can only be approximated by sufficiently deep networks, assuming their size is bounded. However, for constant depths, existing…
Discrete de Rham (DDR) methods provide non-conforming but compatible approximations of the continuous de Rham complex on general polytopal meshes. Owing to the non-conformity, several challenges arise in the analysis of these methods. In…
Motivated by an amazing integrality structure conjecture for the $U(N)$ Chern-Simons quantum invariants of framed knots investigated by Mari\~no and Vafa, a new conjectural formula, named Hecke lifting conjecture, was proposed in…
In this paper we analyze the joint rate distortion function (RDF), for a tuple of correlated sources taking values in abstract alphabet spaces (i.e., continuous) subject to two individual distortion criteria. First, we derive structural…
We prove a realization theorem for rational functions of several complex variables which extends the main theorem of M. Bessmertnyi, "On realizations of rational matrix functions of several complex variables," in Vol. 134 of Oper. Theory…
In the algebraic metacomplexity framework we prove that the decomposition of metapolynomials into their isotypic components can be implemented efficiently, namely with only a quasipolynomial blowup in the circuit size. We use this to…
Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…
In [7], Dong and I proved that the domains $D \subset \mathbb{C}$ of finite volume whose on-diagonal Bergman kernels $K(\cdot, \cdot)$ satisfy $K(z_0, z_0) = Volume(D)^{-1}$ are disks minus closed polar sets. We utilized the solution of the…
The volume conjecture relates the quantum invariant and the hyperbolic geometry. Bonahon-Wong-Yang introduced a new version of the volume conjecture by using the intertwiners between two isomorphic irreducible representations of the skein…
Designing good error correcting codes whose generator matrix has a support constraint, i.e., one for which only certain entries of the generator matrix are allowed to be non-zero, has found many recent applications, including in distributed…
We prove a sensitivity-to-communication lifting theorem for arbitrary gadgets. Given functions $f: \{0,1\}^n\to \{0,1\}$ and $g : \mathcal X\times \mathcal Y\to \{0,1\}$, denote $f\circ g(x,y) := f(g(x_1,y_1),\ldots,g(x_n,y_n))$. We show…
We revisit Haagerup's enigmatic reduction theorem \cite[Theorems 2.1 \& 3.1]{HJX} showing how that theorem may be extended to general von Neumann algebras $\M$ equipped with an arbitrary faithful normal semifinite weight in a manner which…