Related papers: Length Function Compatibility for Group Actions on…

This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…

Finite-horizon lookahead policies are abundantly used in Reinforcement Learning and demonstrate impressive empirical success. Usually, the lookahead policies are implemented with specific planning methods such as Monte Carlo Tree Search…

We present a complete discussion of the boundary term in the action functional of general relativity when the boundary includes null segments in addition to the more usual timelike and spacelike segments. We confirm that ambiguities appear…

Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…

Finite rank median spaces are a simultaneous generalisation of finite dimensional ${\rm CAT}(0)$ cube complexes and real trees. If $\Gamma$ is an irreducible lattice in a product of rank one simple Lie groups, we show that every action of…

We consider additive functionals $X_n(\phi)$ with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector does not need to sum up to 1. These additive functionals…

In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…

We elaborate on a recently proposed extension of the Gerasimov-Drell-Hearn (GDH) sum rule which is achieved by taking derivatives with respect to the anomalous magnetic moment. The new sum rule features a {\it linear} relation between the…

We construct an adjunction between $m$-categories internal to $(\infty,n)$-categories, called $(n,m)$-double $\infty$-categories, and filtrations $A_0\to \dots\to A_m$ where for all $i<m$, $A_i$ is a $(n+i)$-category. We show that this…

We consider smooth actions of lattices in higher-rank semisimple Lie groups on manifolds. We define two numbers $r(G)$ and $m(G)$ associated with the roots system of the Lie algebra of a Lie group $G$. If the dimension of the manifold is…

We continue our reformulation of free dendriform algebras, dealing this time with the free dendriform trialgebra generated be Y over planar rooted trees. We propose a 'deformation' of a vectorial coding used in Part I, giving a LL-lattice…

Information Extraction (IE) stands as a cornerstone in natural language processing, traditionally segmented into distinct sub-tasks. The advent of Large Language Models (LLMs) heralds a paradigm shift, suggesting the feasibility of a…

We prove that if $G$ is an Abelian group and $A_1,\ldots,A_k \subseteq G$ satisfy $m A_i=G$ (the $m$-fold sumset), then $A_1+\ldots+A_k=G$ provided that $k \ge c_m \log n$. This generalizes a result of Alon, Linial, and Meshulam [Additive…

We consider injective first-order interpretations that input and output trees of bounded height. The corresponding functions have polynomial output size, since a first-order interpretation can use a k-tuple of input nodes to represent a…

Motivated from the study of eccentricity, center, and sum of eccentricities in graphs and trees, we introduce several new distance-based global and local functions based on the smallest distance from a vertex to some leaf (called the…

We describe a connection between the combinatorics of generators for certain groups and the combinatorics of Helly's 1913 theorem on convex sets. We use this connection to prove fixed point theorems for actions of these groups on…

We revisit binary decision trees from the perspective of partitions of the data. We introduce the notion of partitioning function, and we relate it to the growth function and to the VC dimension. We consider three types of features:…

We present a new formulation of the loop-tree duality theorem for higher loop diagrams valid both for massless and massive cases. $l$-loop integrals are expressed as weighted sum of trees obtained from cutting $l$ internal propagators of…

We establish a one-to-one correspondence between rational multiplicative group actions on an algebraic variety $X$ and derivations $\partial\colon K_X\to K_X$ of the field of fractions $K_X$ of $X$ satisfying that there exists a generating…

In this paper we present various lower bound results on collective tree spanners and on spanners of bounded treewidth. A graph $G$ is said to admit a system of $\mu$ collective additive tree $c$-spanners if there is a system $\cal{T}$$(G)$…