Related papers: Depicting a generalized shift move in crown diagra…
We prove that every smoothly embedded surface in a 4--manifold can be isotoped to be in bridge position with respect to a given trisection of the ambient 4--manifold; that is, after isotopy, the surface meets components of the trisection in…
$\lambda$-graph systems are labeled Bratteli diagram with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of $\lambda$-graph systems and study extensions of…
Choosing a uniformly sampled simple directed graph realization of a degree sequence has many applications, in particular in social networks where self-loops are commonly not allowed. It has been shown in the past that one can perform a…
In earlier papers we introduced a representation of isotopy classes of compact surfaces embedded in the three-sphere by so called rectangular diagrams. The formalism proved useful for comparing Legendrian knots. The aim of this paper is to…
A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…
In the present paper, we use a generalised shift operator in order to define a generalised modulus of smoothness. By its means, we define generalised Lipschitz classes of functions, and we give their constructive characteristics.…
We formulate the simplest minimal subtraction version for massive $\lambda \phi^4$ scalar fields with $O(N)$ symmetry for generic anisotropic Lifshitz space-times. An appropriate partial$-p$ operation is applied in the bare two-point vertex…
A branched covering surface-knot over an oriented surface-knot $F$ is a surface-knot in the form of a branched covering over $F$. A branched covering surface-knot over $F$ is presented by a graph called a chart on a surface diagram of $F$.…
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
We develop some aspects of a general theory of presentations of subshifts by labelled directed graphs, in particular by compact graphs. Also considered are synchronization properties of subshifts that lead to presentations by countable…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
We propose a generalization of spin algebra using multi-index objects, and a dynamical system analogous to matrix theory. The system has a solution described by generalized spin representation matrices and possesses a symmetry similar to…
In the formulation of his celebrated Formality conjecture, M. Kontsevich introduced a universal version of the deformation theory for the Schouten algebra of polyvector fields on affine manifolds. This universal deformation complex takes…
We show how to encode a Weinstein 4-manifold using a multisection diagram with divides, which is a sequence of cut systems on a surface, together with a separating collection of curves. We give two algorithms to construct a multisection…
The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\cdots…
Normalization is known to help the optimization of deep neural networks. Curiously, different architectures require specialized normalization methods. In this paper, we study what normalization is effective for Graph Neural Networks (GNNs).…
In this paper, we extend the notion of a merge tree to that of a generalized merge tree, a merge tree that includes 1-dimensional cycle birth information. Given a discrete Morse function on a $1$-dimensional regular CW complex, we construct…
In card-based cryptography, a deck of physical cards is used to achieve secure computation. A shuffle, which randomly permutes a card-sequence along with some probability distribution, ensures the security of a card-based protocol. The…
In the present work we prove that given any two unicycle graphs (pseudoforests) that share the same degree sequence there is a finite sequence of 2-switches transforming one into the other such that all the graphs in the sequence are also…