Related papers: Periodicity shadows II. Computational aspects
Classical shadows (CS) has recently emerged as an important framework to efficiently predict properties of an unknown quantum state. A common strategy in CS protocols is to parametrize the basis in which one measures the state by a random…
The B-side of Kontsevich's Homological Mirror Symmetry Conjecture is discussed. We give first a self-contained study of derived categories and their homological algebra, and later restrict to the bounded derived category of schemes and…
We review theories of Asymmetric Dark Matter (ADM), their cosmological implications and detection. While there are many models of ADM in the literature, our review of existing models will center on highlighting the few common features and…
Transitions between steady dynamical regimes in diverse applications are often modelled using discontinuities, but doing so introduces problems of uniqueness. No matter how quickly a transition occurs, its inner workings can affect the…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
Quantum process tomography is a powerful tool for understanding quantum channels and characterizing properties of quantum devices. Inspired by recent advances using classical shadows in quantum state tomography [H.-Y. Huang, R. Kueng, and…
Scarf's algorithm gives a pivoting procedure to find a special vertex -- a dominating vertex -- in down-monotone polytopes. This paper studies the behavior of Scarf's algorithm when employed to find stable matchings in bipartite graphs.…
We study here slopes of periodicity of tilings. A tiling is of slope if it is periodic along direction but has no other direction of periodicity. We characterize in this paper the set of slopes we can achieve with tilings, and prove they…
By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…
We first introduce global arithmetic cohomology groups for quasi-coherent sheaves on arithmetic varieties, adopting an adelic approach. Then, we establish fundamental properties, such as topological duality and inductive long exact…
In this paper we examine the interplay between recurrence properties and the shadowing property in dynamical systems on compact metric spaces. In particular, we demonstrate that if the dynamical system $(X,f)$ has shadowing, then it is…
The inevitable noise in real measurements motivates the problem to continuously quantify the similarity between rigid objects such as periodic time series and proteins given by ordered points and considered up to isometry maintaining…
Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensively studied by theoreticians and practitioners alike. The…
We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
Several conjectural continued fractions found with the help of various algorithms are published in this paper.
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
We derive properties and a characterization of discrete composition matrices which are useful in the field of numerical computation of shape correspondences.