Related papers: The Pascal automorphism has a purely continuous sp…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
The goal of this article is two fold. First, using transcendental shift-like automorphisms of C^k, k > 2 we construct two examples of non-degenerate entire mappings with prescribed ranges. The first example exhibits an entire mapping of…
A phenomenon of classical quantization is discussed. This is revealed in the class of pseudoclassical gauge systems with nonlinear nilpotent constraints containing some free parameters. Variation of parameters does not change local (gauge)…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We prove a spectral decomposition theorem for a well-known self-similar graph, for some finite graphs which are quotients of this graph and for a compactification of it.
We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…
Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os,…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
Contrary to previous approaches bringing together algebraic geometry and signatures of paths, we introduce a Zariski topology on the space of paths itself, and study path varieties consisting of all paths whose iterated-integrals signature…
We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
Let $k$ be a field of characteristic zero, and let $f: k[x,y] \to k[x,y]$, $f: (x,y) \mapsto (p,q)$, be a $k$-algebra endomorphism having an invertible Jacobian. Write $p=a_ny^n+\cdots+a_1y+a_0$, where $n=deg_y(p) \in \mathbb{N}$, $a_i \in…
We study, theoretically and experimentally, a 1-parameter family of transformations and their limiting vector field on the space of plane polygons. These transformations are discrete analogs of completely integrable transformation on closed…
In my 1993 paper, "Pappus's Theorem and the Modular Group", I explained how the iteration of Pappus's Theorem gives rise to a $2$-parameter family of representations of the modular group into the group of projective automorphisms. In this…
We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…
In this paper, we consider a certain convolutional Laplacian for metric measure spaces and investigate its potential for the statistical analysis of complex objects. The spectrum of that Laplacian serves as a signature of the space under…
We introduce an automorphism $\mathcal{S}$ of the space $C(\mathbb{Z}_p,\mathbb{C}_p)$ of continuous functions $\mathbb{Z}_p \rightarrow \mathbb{C}_p$ and show that it can be used to give an alternative construction of the $p$-adic…
We consider a one-dimensional space-inhomogeneous discrete time quantum walk. This model is the Hadamard walk with one defect at the origin which is different from the model introduced by Wojcik et al. [14]. We obtain a stationary measure…
Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…