Related papers: Sequences of Trees and Higher-Order Renormalizatio…
We continue the study of token sliding reconfiguration graphs of independent sets initiated by the authors in an earlier paper (arXiv:2203.16861). Two of the topics in that paper were to study which graphs $G$ are token sliding graphs and…
In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…
With the aid of simple examples we show how to make simple estimates of the sizes of higher-order Feynman graphs. Our methods enable appropriate values of renormalization and factorization scales to be made. They allow the diagnosis of the…
Superposition rules form a class of functions that describe general solutions of systems of first-order ordinary differential equations in terms of generic families of particular solutions and certain constants. In this work we extend this…
A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the…
In this article we construct what we call a higher spectral sequence for any chain complex (or topological space) that is filtered in $n$ compatible ways. For this we extend the previous spectral system construction of the author, and we…
The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms…
I am showing how the ideas behind the renormalisation group can be generalised in order to produce the desired reduction in the degrees of freedom other that the ones considered up to now. Instead of looking only at the renormalisation…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
For a group $G$ acting over a set $X$, the set of all the $G$-equivariant functions, i.e., the set of functions which conmute with the action, ($g\cdot f(x)=g\cdot f(x), \forall g\in G, \forall x\in X$), is a monoid with the composition.…
A new proof of perturbative renormalizability and infrared finiteness for a scalar massless theory is obtained from a formulation of renormalized field theory based on the Wilson renormalization group. The loop expansion of the renormalized…
We address the problem of ordering trees with the same degree sequence by their spectral radii. To achieve that, we consider 2-switch transformations which preserve the degree sequence and establish when the index decreases. Our main…
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have definable Skolem functions (by a monadic formula with…
In this paper, we review some general formulations of exact renormalisation group equations and loop equations for tensor models and tensorial group field theories. We illustrate the use of these equations in the derivation of the leading…
The QED renormalization is restudied by using a mass-dependent subtraction which is performed at a time-like renormalization point. The subtraction exactly respects necessary physical and mathematical requirements such as the gauge…
We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…
Random forests are ensemble methods which grow trees as base learners and combine their predictions by averaging. Random forests are known for their good practical performance, particularly in high dimensional set-tings. On the theoretical…
I derive a Wick ordered continuous renormalization group equation for fermion systems and show that a determinant bound applies directly to this equation. This removes factorials in the recursive equation for the Green functions, and thus…