Related papers: Local and global moves on locally planar trivalent…
We write down three kinds of scale transformations {\tt i-iii)} on the noncommutative plane. {\tt i)} is the analogue of standard dilations on the plane, {\tt ii)} is a re-scaling of the noncommutative parameter $\theta$, and {\tt iii)} is…
We introduce a class of labeled graphs (with legs) which contains two classes of GKM graphs of $4n$-dimensional manifolds with $T^{n}\times S^{1}$-actions, i.e., GKM graphs of the toric hyperK${\rm\ddot{a}}$hler manifolds and of the…
We present new degree-sequence lower bounds on the expected size of an independent set from the hard-core model. For arbitrary graphs, we establish a multivariate lower bound inspired by a conjecture of the first author and Kang and a…
We present a novel lambda calculus that casts the categorical approach to the study of quantum protocols into the rich and well established tradition of type theory. Our construction extends the linear typed lambda calculus with a linear…
Let $G_{g,b}$ be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus $g$ with $b$ boundary components. We describe the set $A_{g,b}$ of all automorphisms of…
A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-known…
We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics, with judicious use of the eta-conversion rule of the lambda calculus. The traversal…
This work demonstrates the utility of gradients for the global optimization of certain differentiable functions with many suboptimal local minima. To this end, a principle for generating search directions from non-local quadratic…
Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a…
In a recent paper (arXiv:math-ph/0609076) the authors investigated the basic global geometry of congruence moduli curves and shape curves of 3-body motions with vanishing angular momentum. Here the study is extended to the case of planary…
Unifying approaches by amongst others Archimedes, Kepler, Goldberg, Caspar and Klug, Coxeter, and Conway, and extending on a previous formalisation of the concept of local symmetry preserving (lsp) operations, we introduce a formal…
Subgraph counting is a fundamental task for analyzing structural patterns in graph-structured data, with important applications in domains such as computational biology and social network analysis, where recurring motifs reveal functional…
The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that…
We classify topologically trivial Legendrian $\Theta$-graphs and identify the complete family of nondestabilizeable Legendrian realizations in this topological class. In contrast to all known results for Legendrian knots, this is an…
We continue our study of the local Gromov-Witten invariants of curves in Calabi-Yau 3-folds. We define relative invariants for the local theory which give rise to a 1+1-dimensional TQFT taking values in the ring Q[[t]]. The associated…
A class of two-dimensional globally scale-invariant, but not conformally invariant, theories is obtained. These systems are identified in the process of discussing global and local scaling properties of models related by duality…
The unions of directed graphs are the simplest examples of pushouts of directed graphs. The conditions under which they contravariantly induce surjective gauge-equivariant pullbacks of graph C*-algebras have been well studied and vastly…
Recently, \citeauthor*{akbari2021locality}~(ICALP 2023) studied the locality of graph problems in distributed, sequential, dynamic, and online settings from a {unified} point of view. They designed a novel $O(\log n)$-locality deterministic…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
$\lambda$-Scale is an enrichment of lambda calculus which is adapted to emergent algebras. It can be used therefore in metric spaces with dilations.