Related papers: A nesting-free normal form for nested conditions i…
Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this paper, we propose (for the first time) a notion of…
The notion of regular cell complexes plays a central role in topological combinatorics because of its close relationship with posets. A generalization, called totally normal cellular stratified spaces, was introduced by the third author by…
We report on work in progress on 'nested term graphs' for formalizing higher-order terms (e.g. finite or infinite lambda-terms), including those expressing recursion (e.g. terms in the lambda-calculus with letrec). The idea is to represent…
In this paper we prove several results on normal forms for linear displacement context-free grammars. The results themselves are rather simple and use well-known techniques, but they are extensively used in more complex constructions.…
We present new conditions that eliminate a large class of graphs from being induced neighbourhoods of finite vertex-transitive graphs.
We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…
We give unique analytic "normal forms" for germs of a holomorphic vector field of the complex plane in the neighborhood of an isolated singularity of saddle-node type having a convergent formal separatrix. We specifically address the…
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the $K$-core and the $K$-scaffold, among others. We name such class of subgraphs $K$-nested subgraphs due to the fact…
Interaction nets are a form of restricted graph rewrite system that can serve as a graphical or textual programming language. As such, benefits include one-step confluence, ease of parallelism and explicit garbage collection. However, some…
We present the theory of non-stationary normal forms for uniformly contracting smooth extensions with sufficiently narrow Mather spectrum. We give coherent proofs of existence, (non)uniqueness, and a description of the centralizer results.…
In this paper we present local Sternberg conjugation theorems near attracting fixed points for lattice systems. The interactions are spatially decaying and are not restricted to finite distance. The conjugations obtained retain the same…
We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs $H$ with components of sublinear order. As a corollary, we recover and extend the work of K\"uhn and…
For a formation $\mathfrak{F}$ of finite groups consider a graph whose vertices are elements of a finite group and two vertices are connected by an edge if and only if they generates non-$\mathfrak{F}$-group as elements of a group. A…
The representation of the bare parameters of Lagrangian in terms of total vertex Green's functions is used to obtain the general form of renormalization conditions. In the framework of this approach renormalizations can be carried out…
Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…
We introduce a new canonical form of lattices called the systematic normal form (SNF). We show that for every lattice there is an efficiently computable "nearby" SNF lattice, such that for any lattice one can solve lattice problems on its…
In this paper we give necessary and sufficient conditions for a knot type to admit non-loose Legendrian and transverse representatives in some overtwisted contact structure, classify all non-loose rational unknots in lens spaces, and…
We review some recent results and announce some new ones on the problem of the existence of ground states for the Nonlinear Schr\"odinger Equation on graphs endowed with vertices where the matching condition, instead of being free (or…