相关论文: Form factor for large quantum graphs: evaluating o…

It is believed that some numerical technique must be employed for the determination of the system parameters of a visual binary or a star with a planet because the relevant equations are not only highly nonlinear but also transcendental…

Summation methods play a very important role in quantum field theory because all perturbation series are divergent and the expansion parameter is not always small. A number of methods have been tried in this context, most notably Pade…

Recurrence is a fundamental property of dynamical systems, which can be exploited to characterise the system's behaviour in phase space. A powerful tool for their visualisation and analysis called recurrence plot was introduced in the late…

We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.

Refactoring is an essential activity during software evolution. Frequently, practitioners rely on such transformations to improve source code maintainability and quality. As a consequence, this process may produce new source code entities…

The concept of time emerges as an ordering structure in a classical statistical ensemble. Probability distributions $p_\tau(t)$ at a given time $t$ obtain by integrating out the past and future. We discuss all-time probability distributions…

We study dynamic $(1-\epsilon)$-approximate rounding of fractional matchings -- a key ingredient in numerous breakthroughs in the dynamic graph algorithms literature. Our first contribution is a surprisingly simple deterministic rounding…

We propose a new method to characterize the different phases observed in the non-perturbative numerical approach to quantum gravity known as Causal Dynamical Triangulation. The method is based on the analysis of the eigenvalues and the…

We exploit a decomposition of graph traversals to give a novel characterization of depth-first and breadth-first traversals as universal constructions. Specifically, we introduce functors from two different categories of edge-ordered…

Crystals arise as the result of the breaking of a spatial translation symmetry. Similarly, translation symmetries can also be broken in time so that discrete time crystals appear. Here, we introduce a method to describe, characterize, and…

We consider quantum systems with a chaotic classical limit that are perturbed by a point-like scatterer. The spectral form factor K(tau) for these systems is evaluated semiclassically in terms of periodic and diffractive orbits. It is shown…

We propose a category-theoretic definition of retrodiction and use it to exhibit a time-reversal symmetry for all quantum channels. We do this by introducing retrodiction families and functors, which capture many intuitive properties that…

We initiate the study of the Bipartite Contraction problem from the perspective of parameterized complexity. In this problem we are given a graph $G$ and an integer $k$, and the task is to determine whether we can obtain a bipartite graph…

We describe an efficient scheme for evaluating higher order contributions to primordial cosmological perturbations using the "in-in" formalism, which is the basis of modern calculations of non-Gaussian and higher order contributions to the…

This letter is an investigation of the pion form factor utilizing recently developed effective field theory techniques. The primary results reported are: Both the transition and electromagnetic form factors are corrected at order…

To address limitations of the graph fractional Fourier transform (GFRFT) Wiener filtering and the traditional joint time-vertex fractional Fourier transform (JFRFT) Wiener filtering, this study proposes a filtering method based on the…

We extend the definition of an orbit portrait to the context of non-autonomous iteration, both for the combinatorial version involving collections of angles and for the dynamic version involving external rays where combinatorial portraits…

The form-factor bootstrap approach is applied to the perturbed minimal models $M_{2,2n+3}$ in the direction of the primary field $\phi_{1,3}$. These theories are integrable and contain $n$ massive scalar particles, whose $S$--matrix is…

We introduce in this paper the mechanism of graph random features (GRFs). GRFs can be used to construct unbiased randomized estimators of several important kernels defined on graphs' nodes, in particular the regularized Laplacian kernel. As…

In this article we study inverse problems of recovering a space-time dependent source component from the lateral boundary observation in a subidffusion model. The mathematical model involves a Djrbashian-Caputo fractional derivative of…