Related papers: The attractor structure of logarithmic iterations …
Using techniques in logarithmic geometry, we construct a logarithmic analogue of the Fulton--MacPherson configuration spaces. We similarly construct a logarithmically smooth degeneration of the Fulton--MacPherson configuration spaces. Both…
The article focuses on word (or string) attractors, which are sets of positions related to the text compression efficiency of the underlying word. The article presents two combinatorial algorithms based on Suffix automata or Directed…
Many engineering problems are described by systems of nonlinear equations, which may exhibit multiple solutions, in a challenging situation for root-finding algorithms. The existence of several solutions may give rise to complex basins of…
Let $P$ be a set of points and $L$ a set of lines in the (extended) Euclidean plane, and $I \subseteq P\times L$, where $i =(p,l) \in I$ means that point $p$ and line $l$ are incident. The incidences can be interpreted as quadratic…
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…
The methods of integral operators on the cohomology of Hilbert schemes of points on surfaces are developed. They are used to establish integral bases for the cohomology groups of Hilbert schemes of points on a class of surfaces (and…
We present a new approach for constructing covariant symplectic structures for geometrical theories, based on the concept of adjoint operators. Such geometric structures emerge by direct exterior derivation of underlying symplectic…
We construct helicoid-like embedded minimal disks with axes along self-similar curves modeled on logarithmic spirals. The surfaces have a self-similarity inherited from the curves and the nature of the construction. Moreover, inside of a…
We explicitly construct a class of multivariate generalized hypergeometric series which is conjectured in our previous paper [Alkalaev & Mandrygin 2025] to calculate multipoint one-loop parametric conformal integrals in $D$ dimensions. Our…
Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…
We prove an intersection formula for two plane branches in terms of their semigroups and key polynomials. Then we provide a strong version of Bayer's theorem on the set of intersection numbers of two branches and apply it to the logarithmic…
We introduce local iterated function systems and present some of their basic properties. A new class of local attractors of local iterated function systems, namely local fractal functions, is constructed. We derive formulas so that these…
In this paper, we survey and refine several results -- some previously established in the literature -- that facilitate the construction of exponential bases on planar domains with explicit control over the associated frame bounds. We apply…
We consider logarithmic vector fields parametrized by finite collections of weighted hyperplanes. For a finite collection of weighted hyperplanes in a two-dimensional vector space, it is known that the set of such vector fields is a free…
A proof for a conjecture by Shadrin and Zvonkine, relating the entries of a matrix arising in the study of Hurwitz numbers to a certain sequence of rational numbers, is given. The main tools used are iteration matrices of formal power…
Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…
Trajectories in logarithmic potentials are investigated by taking as example the motion of an electron within a cylindrical capacitor. The solution of the equation of motion in plane polar coordinates, (r,{\phi}) is attained by forming a…
The beacon model is a recent paradigm for guiding the trajectory of messages or small robotic agents in complex environments. A beacon is a fixed point with an attraction pull that can move points within a given polygon. Points move…
Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…
We study tensors on Lie groupoids suitably compatible with the groupoid structure, called {\em multiplicative}. Our main result gives a complete description of these objects only in terms of infinitesimal data. Special cases include the…