相关论文: Sequences of Trees and Higher-Order Renormalizatio…

We show that, for any cluster-tilted algebra of finite representation type over an algebraically closed field, the following three definitions of a maximal green sequence are equivalent: (1) the usual definition in terms of Fomin-Zelevinsky…

For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…

Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…

In a previous paper, "Generalized Green functions and unipotent classes for finite reductive groups, I", we have determined certain unknown scalars involved in the algorithm of computing generalized Green functions in the case of SL_n. In…

We establish the renormalization group equation for the running action in the context of a one quantum particle system. This equation is deduced by integrating each fourier mode after the other in the path integral formalism. It is free of…

The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…

This paper contains a classification of countable lower 1-transitive linear orders. The notion of lower 1-transitivity generalises that of 1-transitivity for linear orders, and is essential for the structure theory of 1-transitive trees.…

We derive the renormalization group equations for a generic nonrenormalizable theory. We show that the equations allow one to derive the structure of the leading divergences at any loop order in terms of one-loop diagrams only. In chiral…

We introduce a preorder on an inverse semigroup $S$ associated to any normal inverse subsemigroup $N$, that lies between the natural partial order and Green's ${\mathscr J}$-relation. The corresponding equivalence relation $\simeq_N$ is not…

We define k-genericity and k-largeness for a subset of a group, and determine the value of k for which a k-large subset of G^n is already the whole of G^n , for various equationally defined subsets. We link this with the inner measure of…

This paper aims at presenting the first steps towards a formulation of the Exact Renormalization Group Equation in the Hopf algebra setting of Connes and Kreimer. It mostly deals with some algebraic preliminaries allowing to formulate…

The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The complexities of recognising many subclasses of SOGs are known.…

A degree sequence is a sequence ${\bf s}=(N_i,i\geq 0)$ of non-negative integers satisfying $1+\sum_i iN_i=\sum_i N_i<\infty$. We are interested in the uniform distribution $\mathbb{P}_{{\bf s}}$ on rooted plane trees whose degree sequence…

Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…

We find the group of equivalence transformations for equations of the form $y''= A(x)y' + F(y),$ where $A$ and $F$ are arbitrary functions. We then give a complete group classification of these families of equations, using a direct method…

Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove…

Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…

An imitation of 2d field theory is formulated by means of a model on the hierarhic tree (with branching number close to one) with the same potential and the free correlators identical to 2d correlators ones. Such a model carries on some…

The theory of {\Gamma}-species is developed to allow species-theoretic study of quotient structures in a categorically rigorous fashion. This new approach is then applied to two graph-enumeration problems which were previously unsolved in…

We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…