Related papers: Quasi-polynomial Hitting Sets for Circuits with Re…
Oblique decision trees combine the transparency of trees with the power of multivariate decision boundaries, but learning high-quality oblique splits is NP-hard, and practical methods still rely on slow search or theory-free heuristics. We…
We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A $(2+\epsilon)$-approximation for all-pairs shortest paths in $O(\log^2{n} / \epsilon)$ rounds on unweighted…
We consider the unextendible product bases (UPBs) of fixed cardinality $m$ in quantum systems of $n$ qubits. These UPBs are divided into finitely many equivalence classes with respect to an equivalence relation introduced by N. Johnston.…
Following a remark of Lawvere, we explicitly exhibit a particularly elementary bijection between the set T of finite binary trees and the set T^7 of seven-tuples of such trees. "Particularly elementary" means that the application of the…
A Pfaffian circuit is a tensor contraction network where the edges are labeled with changes of bases in such a way that a very specific set of combinatorial properties are satisfied. By modeling the permissible changes of bases as systems…
We introduce the quasi-ordinarization transform of a numerical semigroup. This transform will allow to organize all the semigroups of a given genus in a forest rooted at all quasi-ordinary semigroups with the given genus. This construction…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is…
Symmetry-Protected Topological (SPT) phases are gapped phases of quantum matter protected by global symmetries that cannot be adiabatically deformed to a trivial phase without breaking symmetry. In this work, we show that, for several SPT…
We present approximations to tree level multiparton scattering amplitudes which are appropriate when two partons are unresolved. These approximations are required for the analytic isolation of infrared singularities of n+2 parton scattering…
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…
Superconducting circuits consisting of a few low-anharmonic transmons coupled to readout and bus resonators can perform basic quantum computations. Since the number of qubits in such circuits is limited to not more than a few tens, the…
We introduce low-stretch trees to the visualization community with LSQT, our novel technique that uses quasi-trees for both layout and edge bundling. Our method offers strong computational speed and complexity guarantees by leveraging the…
We present the first fixed-parameter tractable (FPT) algorithms for exact computation of generalized hypertree width (ghw) and fractional hypertree width (fhw). Our algorithms are parameterized by the target width, the rank, and the maximum…
We apply a semi-classical method to compute the conformal field theory (CFT) data for the U(N)xU(N) non-abelian Higgs theory in four minus epsilon dimensions at its complex fixed point. The theory features more than one coupling and walking…
We present improved deterministic algorithms for approximating shortest paths in the Congested Clique model of distributed computing. We obtain $poly(\log\log n)$-round algorithms for the following problems in unweighted undirected…
The dynamics of monitored systems can exhibit a measurement-induced phase transition (MIPT) between entangling and disentangling phases, tuned by the measurement rate. When the dynamics obeys a continuous symmetry, the entangling phase…
Given a directed graph $G$ on $n$ vertices with a special vertex $s$, the directed minimum degree spanning tree problem requires computing a incoming spanning tree rooted at $s$ whose maximum tree in-degree is the smallest among all such…
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are equal. We prove that these equalities hold for any…
We extend (scheme-theoretic) Bruhat-Tits theory to quasi-reductive groups i.e. with trivial split unipotent radical over discretely valued henselian non-archimedean fields $K$, whose ring of integers is excellent and residue field is…
Potentially large non-universal corrections to the soft supersymmetry breaking parameters arise from their evolution between the Planck and the grand-unification scales. We detail typical patterns of non-universality in GUT models, as well…