Related papers: Quasi-polynomial Hitting Sets for Circuits with Re…
A one dimensional, parity-time (${\cal PT}$)-symmetric magnetic metamaterial comprising split-ring resonators having both gain and loss is investigated. In the linear regime, the transition from the exact to the broken ${\cal PT}$-phase is…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
Many classical constructions, such as Plotkin's and Turyn's, were generalized by matrix product (MP) codes. Quasi-twisted (QT) codes, on the other hand, form an algebraically rich structure class that contains many codes with best-known…
We devise tractable models of unitary quantum many-body dynamics on tree graphs, as a first step towards a deeper understanding of dynamics in non-Euclidean spaces. To this end, we first demonstrate how to construct strictly local quantum…
We explore new connections between complete non-ambiguous trees (CNATs) and permutations. We give a bijection between tree-like tableaux and a specific subset of CNATs. This map is used to establish and solve a recurrence relation for the…
We derive semiclassical expressions for spectra, weighted by matrix elements of a Gaussian observable, relevant to a range of molecular and mesoscopic systems. We apply the formalism to the particular example of the resonant tunneling diode…
We give an algorithm for solving unique games (UG) instances whenever low-degree sum-of-squares proofs certify good bounds on the small-set-expansion of the underlying constraint graph via a hypercontractive inequality. Our algorithm is in…
In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more…
The phenomenon of PT (parity- and time-reversal) symmetry breaking is conventionally associated with a change in the complex mode spectrum of a non-Hermitian system that marks a transition from a purely oscillatory to an exponentially…
We perturb the non-rotating BTZ black hole with a non-minimally coupled massless scalar field, and we compute the quasinormal spectrum exactly. We solve the radial equation in terms of hypergeometric functions, and we obtain an analytical…
The recently introduced graph parameter tree-cut width plays a similar role with respect to immersions as the graph parameter treewidth plays with respect to minors. In this paper, we provide the first algorithmic applications of tree-cut…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
Some new Hamiltonian systems of quasi-Painlev\'e type are presented and the analogue of Okamoto's space of initial conditions computed. Using the geometric approach that was introduced originally for the identification problem of Painlev\'e…
We consider the probability that a spanning tree chosen uniformly at random from a graph can be partitioned into a fixed number $k$ of trees of equal size by removing $k-1$ edges. In that case, the spanning tree is called {\em splittable}.…
In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…
We study the level-spacing statistics in the entanglement spectrum of output states of random universal quantum circuits where qubits are subject to a finite probability of projection to the computational basis at each time step. We…
We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs…
Quasi-subfield polynomials were introduced by Huang et al. together with a new algorithm to solve the Elliptic Curve Discrete Logarithm Problem (ECDLP) over finite fields of small characteristic. In this paper we provide both new…
In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the…