Related papers: Quasi-polynomial Hitting Sets for Circuits with Re…

A hitting-set generator (HSG) is a polynomial map $G:\mathbb{F}^k \to \mathbb{F}^n$ such that for all $n$-variate polynomials $C$ of small enough circuit size and degree, if $C$ is nonzero, then $C\circ G$ is nonzero. In this paper, we give…

Parity-time-symmetric ($\mathcal{PT}$-symmetric) optical waveguide couplers offer a great potential for future applications in integrated optics. Studies of nonlinear $\mathcal{PT}$-symmetric couplers present new possibilities for…

The physics of systems that cannot be described by a Hermitian Hamiltonian, has been attracting a great deal of attention in recent years, motivated by their nontrivial responses and by a plethora of applications for sensing, lasing, energy…

We study a model of constraint satisfaction problems geared towards instances with few variables but with domain of unbounded size (udCSP). Our model is inspired by recent work on FPT algorithms for MinCSP where frequently both upper and…

Unitary coupled cluster (UCC) theory offers a promising Hermitian alternative to conventional coupled cluster (CC) theory, but its practical implementation is hindered by the non-truncating nature of the Baker-Campbell-Hausdorff (BCH)…

A quasi-tree is a geodesic metric space quasi-isometric to a tree. We give a general construction of many actions of groups on quasi-trees. The groups we can handle include non-elementary (relatively) hyperbolic groups, rank 1 CAT(0)…

In the quadratic minimum spanning tree problem (QMSTP) one wants to find the minimizer of a quadratic function over all possible spanning trees of a graph. We present a formulation of the QMSTP as a mixed-integer semidefinite program…

We investigate the complexity of uniform OR circuits and AND circuits of polynomial-size and depth. As their name suggests, OR circuits have OR gates as their computation gates, as well as the usual input, output and constant (0/1) gates.…

We formulate gaussian and circular random-matrix models representing a coupled system consisting of an absorbing and an amplifying resonator, which are mutually related by a generalized time-reversal symmetry. Motivated by optical…

Exceptional points (EPs), the degeneracy point of non-Hermitian systems, have recently attracted great attention after its ability to greatly enhance the sensitivity of micro-cavities is demonstrated experimentally. Unlike the usual…

In this paper we study some properties of the class of nu-quasi-ordinary hypersurface singularities. They are defined by a very mild condition on its (projected) Newton polygon. We associate with them a Newton tree and characterize…

Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes…

In this work, we present a quantum circuit for a binary classification prediction algorithm using a random forest model. The quantum prediction algorithm is presented in our previous works. We construct a circuit and implement it using…

We construct semi-local and global realizations of SU(5) GUTs in F-theory that utilize a U(1)_PQ symmetry to protect against dimension four proton decay. Symmetries of this type, which assign charges to H_u and H_d that forbid a tree level…

We study semi-infinite paths of the radial spanning tree (RST) of a Poisson point process in the plane. We first show that the expectation of the number of intersection points between semi-infinite paths and the sphere with radius $r$ grows…

We study a generalization of the classic Spanning Tree problem that allows for a non-uniform failure model. More precisely, edges are either \emph{safe} or \emph{unsafe} and we assume that failures only affect unsafe edges. In Unweighted…

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…

Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…

Unconventional $p$-wave magnets (UPMs) with odd-parity spin textures have attracted interest for their zero net magnetization and anisotropic spin-split Fermi surfaces. Here, we explore a non-Hermitian open quantum system composed of a…

We show that unrolled quantum groups at odd roots of unity give rise to relative modular categories. These are the main building blocks for the construction of 1+1+1-TQFTs extending CGP invariants, which are non-semisimple quantum…