Related papers: Shrinking good coordinate systems associated to Ku…
Employing the Kuramoto model as an illustrative example, we show how the use of the mean field approximation can be applied to large networks of phase oscillators with assortativity. We then use the ansatz of Ott and Antonsen [Chaos 19,…
In order to simulate open quantum systems, many approaches (such as Hamiltonian-based solvers in dynamical mean-field theory) aim for a reproduction of a desired environment spectral density in terms of a discrete set of bath states,…
B. Tanay et. al. introduced and studied fuzzy soft topological spaces. Here we introduce fuzzy soft point and study the concept of neighborhood of a fuzzy soft point in a fuzzy soft topological space. We also study fuzzy soft closure and…
We establish sharp local existence results for the Hirota-Satsuma system in $H^k(\mathbb{R}) \times H^s(\mathbb{R})$, depending on the ratio between the dispersion of the components. These theorems significantly generalize previous works,…
Noncoherent communication systems have regained interest due to the growing demand for high-mobility and low-latency applications. Most existing studies using large antenna arrays rely on the far-field approximation, which assumes locally…
Correlation filters (CFs) are a class of classifiers that are attractive for object localization and tracking applications. Traditionally, CFs have been designed in the frequency domain using the discrete Fourier transform (DFT), where…
We consider the Kuramoto model on sparse random networks such as the Erd\H{o}s-R\'enyi graph or its combination with a regular two-dimensional lattice and study the dynamical scaling behavior of the model at the synchronization transition…
Particles propagating in de Sitter spacetime can be described by the topological BF $\SO(4,1)$ theory coupled to point charges. Gravitational interaction between them can be introduced by adding to the action a symmetry breaking term, which…
Last-mile delivery systems commonly propose the use of autonomous robotic vehicles to increase scalability and efficiency. The economic inefficiency of collecting accurate prior maps for navigation motivates the use of planning algorithms…
We apply a dynamical systems approach to concatenation of quantum error correcting codes, extending and generalizing the results of Rahn et al. [1] to both diagonal and nondiagonal channels. Our point of view is global: instead of focusing…
In this paper, we consider the Cauchy problem of local well-posedness of the Chern-Simons-Dirac system in the Lorenz gauge for $B^{\frac14}_{2,1}$ initial data. We improve the low regularity well-posedness, compared to Huh-Oh \cite{huhoh}…
In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…
Combinatorial optimization problems are ubiquitous in various disciplines and applications. Many heuristic algorithms have been devoted to solve these types of problems. In order to increase the efficiency for finding the optimal solutions,…
Useful relations describing arbitrary parameters of given quantum systems can be derived from simple physical constraints imposed on the vectors in the corresponding Hilbert space. This is well known and it usually proceeds by partitioning…
Re-localizing a camera from a single image in a previously mapped area is vital for many computer vision applications in robotics and augmented/virtual reality. In this work, we address the problem of estimating the 6 DoF camera pose…
Traditional clustering algorithms often struggle with high-dimensional and non-uniformly distributed data, where low-density boundary samples are easily disturbed by neighboring clusters, leading to unstable and distorted clustering…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
A knot is a circle embedded in the space. Projecting a knot on a plane, we obtain a diagram which is known as the knot diagram. The vertices of the diagram, where the curved lines are crossed, can be considered as sites occupied by…
We describe a subroutine that improves the running time of any subdivision algorithm for real root isolation. The subroutine first detects clusters of roots using a result of Ostrowski, and then uses Newton iteration to converge to them.…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…