Related papers: Trace and antitrace maps for aperiodic sequences, …
The paper presents an alternative way to classical stereocorrelation. First, 2D image processing of random patterns is described. Sub-pixel displacements are determined using phase analysis. Then distortion evaluation is presented. The…
We present a novel technique to identify calendar-based (annual, monthly and daily) periodicities of an interval-based temporal pattern. An interval-based temporal pattern is a pattern that occurs across a time-interval, then disappears for…
We address the problem of merging graph and feature-space information while learning a metric from structured data. Existing algorithms tackle the problem in an asymmetric way, by either extracting vectorized summaries of the graph…
We consider the alternating sign matrices of the odd order that have some kind of central symmetry. Namely, we deal with matrices invariant under the half-turn, quarter-turn and flips in both diagonals. In all these cases, there are two…
Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the…
We identify Melrose's suspended algebra of pseudodifferential operators with a subalgebra of the algebra of parametric pseudodifferential operators with parameter space $\R$. For a general algebra of parametric pseudodifferential operators,…
Anomaly detection in dynamic graphs presents a significant challenge due to the temporal evolution of graph structures and attributes. The conventional approaches that tackle this problem typically employ an unsupervised learning framework,…
We investigate the dependence of Poincar\'e recurrence-times statistics on the choice of recurrence-set, by sampling the dynamics of two- and four-dimensional Hamiltonian maps. We derive a method that allows us to visualize the direct…
Learning to compute, the ability to model the functional behavior of a circuit graph, is a fundamental challenge for graph representation learning. Yet, the dominant paradigm is architecturally mismatched for this task. This flawed…
We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the well-known notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of…
Networks are widely used to model real-world systems and uncover their topological features. Network properties such as the degree distribution and shortest path length have been computed in numerous real-world networks, and most of them…
We present an algebraic construction of trace-based De Bruijn tori over finite fields, focusing on the nonzero variant that omits the all-zero pattern. The construction arranges nonzero field elements on a toroidal grid using two…
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where…
We study the numerical anisotropy existent in compact difference schemes as applied to hyperbolic partial differential equations, and propose an approach to reduce this error and to improve the stability restrictions based on a previous…
Graph Laplacians and related nonlinear mappings into low dimensional spaces have been shown to be powerful tools for organizing high dimensional data. Here we consider a data set X in which the graph associated with it changes depending on…
Altermagnetism, as an unconventional antiferromagnetism, exhibits collinear-compensated magnetic order in real space and spin-splitting band structure in reciprocal space. In this work, we propose a general approach to generating…
A non-zero $\mathbb{F}$-linear map from a finite-dimensional commutative $\mathbb{F}$-algebra to $\mathbb{F}$ is called an $\mathbb{F}$-valued trace if its kernel does not contain any non-zero ideals. In this article, we utilize an…
The transmission of a vertex $v$ of a graph $G$ is the sum of distances from $v$ to all the other vertices in $G$. A graph is transmission irregular if all of its vertices have pairwise different transmissions. A starlike tree…
We introduce the concept of 2-cyclicity for families of one-dimensional maps with a non-hyperbolic fixed point by analogy to the cyclicity for families of planar vector fields with a weak focus. This new concept is useful in order to study…
In this paper, the author investigates the impact of external sources on the pattern formation and long-time behavior of concentration profiles of passive tracers in a two-dimensional shear flow. It is shown that a time-periodic…