Related papers: Local and global moves on locally planar trivalent…

We study the semantics of an untyped lambda-calculus equipped with operators representing read and write operations from and to a global store. We adopt the monadic approach to model side-effects and treat read and write as algebraic…

We translate the action of local Clifford operations on graph states into transformations on their associated graphs - i.e. we provide transformation rules, stated in purely graph theoretical terms, which completely characterize the…

The aim of the current paper is to clarify some aspects of the formalism used for describing the scalar-tensor gravity characterized by four arbitrary local functionals of the scalar field. We recall the objects that are invariant with…

We extend the concept of a partial group action to non-associative algebras in a variety \(\mathcal{V}(I)\), solve the globalization problem within \(\mathcal{V}(I)\) and examine its universal property. It is achieved using what we call the…

We consider sufficient conditions to determine the global dynamics for equivariant maps of the plane with a unique fixed point which is also hyperbolic. When the map is equivariant under the action of a compact Lie group, it is possible to…

Global aspects of the motion of passive scalars in time-dependent incompressible fluid flows are well described by volume-preserving (Liouvillian) three-dimensional maps. In this paper the possible invariant structures in Liouvillian maps…

It is shown that the orbits of the space of local deformations of the Lie algebra $\bar{A_5}$ over an algebraically closed field $K$ of characteristic 2 with respect to the automorphism group $\mathrm{PGL} (6)$ correspond to $\mathrm{GL}…

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [Tadi\'c, Physica A {\bf 293},…

A stronger foundation for earlier work on the effects of number scaling, and local mathematics is described. Emphasis is placed on the effects of scaling on coordinate systems. Effects of scaling are represented by a scalar field, $\theta,$…

We create an invariant of virtual Y-oriented trivalent spatial graphs using colorings by virtual Niebrzydowski algebras. This paper generalizes the color invariants using virtual tribrackets and Niebrzydowski algebras by Nelson and Pico,…

In this short note, we investigate the effect of region crossing change on planar trivalent graphs.

We calculate non-Gaussianities in the bispectrum and trispectrum arising from the cubic term in the local expansion of the scalar curvature perturbation. We compute to three-loop order and for general momenta. A procedure for evaluating the…

When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating $\beta$-normal linear lambda terms. In this brief note, it is shown (by…

There are many classical random walk in random environment results that apply to ergodic random planar environments. We extend some of these results to random environments in which the length scale varies from place to place, so that the…

A graph is locally chordal if each of its small-radius balls is chordal. In an earlier work [AKK25], the authors and Kobler proved that locally chordal graphs can be characterized by having chordal local covers, by forbidding short cycles…

In this article, we study mappings acting between domains of two factor spaces by certain groups of M\"{o}bius automorphisms of the unit ball that act discontinuously and do not have fixed points. For such mappings, we have established…

A graph is called bivalent or trivalent if there exists an eigenvector of the graph Laplacian composed from {-1,1} or {-1,0,1}, respectively. These bivalent and trivalent eigenvectors are important for engineering applications, in…

$\beta$-skeletons are well-known neighborhood graphs for a set of points. We extend this notion to sets of line segments in the Euclidean plane and present algorithms computing such skeletons for the entire range of $\beta$ values. The main…