Related papers: Mathematical Structure of Syntactic Merge
In these lectures we discuss some basic aspects of Hamiltonian formalism, which usually do not appear in standard texbooks on classical mechanics for physicists. We pay special attention to the procedure of Hamiltonian reduction…
The distributed representations currently used are dense and uninterpretable, leading to interpretations that themselves are relative, overcomplete, and hard to interpret. We propose a method that transforms these word vectors into reduced…
We consider multiple polylogarithms in a single variable at non-positive integers. Defining a connected graded Hopf algebra, we apply Connes' and Kreimer's algebraic Birkhoff decomposition to renormalize multiple polylogarithms at…
We identify two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in…
Two new results concerning complements in a semisimple Hopf algebra are proved. They extend some well known results from group theory. The uniqueness of Krull Schmidt Remak type decomposition is proved for semisimple completely reducible…
These notes -- originating from a one-semester class by their second author at the University of Minnesota -- survey some of the most important Hopf algebras appearing in combinatorics. After introducing coalgebras, bialgebras and Hopf…
In this paper we suggest how the mathematical concept of hyperstructures may be a useful tool in the study of the higher, hierachical structure of languages.
The natural Hopf algebra $\mathbf{N} \cdot \mathcal{O}$ of an operad $\mathcal{O}$ is a Hopf algebra whose bases are indexed by some words on $\mathcal{O}$. We construct polynomial realizations of $\mathbf{N} \cdot \mathcal{O}$ by using…
Much like sentences are composed of words, words themselves are composed of smaller units. For example, the English word questionably can be analyzed as question+able+ly. However, this structural decomposition of the word does not directly…
We study the structure of renormalization Hopf algebras of gauge theories. We identify certain Hopf subalgebras in them, whose character groups are semidirect products of invertible formal power series with formal diffeomorphisms. This can…
This paper describes an abstract machine for linguistic formalisms that are based on typed feature structures, such as HPSG. The core design of the abstract machine is given in detail, including the compilation process from a high-level…
Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…
We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…
We summarize recent results connecting multiloop Feynman diagram calculations to different parts of mathematics, with special attention given to the Hopf algebra structure of renormalization.
We begin by reviewing a technique to approximate the dynamics of stochastic programs --written in a stochastic process algebra-- by a hybrid system, suitable to capture a mixed discrete/continuous evolution. In a nutshell, the discrete…
This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…
This article studies the construction of Hopf algebras $H$ acting on a given algebra $K$ in terms of algebra morphisms $ \sigma \colon K \rightarrow \mathrm{M}_n(K)$. The approach is particularly suited for controlling whether these actions…
Hierarchical Merging is a technique commonly used to summarize very long texts ($>$100K tokens) by breaking down the input into smaller sections, summarizing those sections individually, and then merging or combining those summaries into a…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
In this paper we are going to find a rooted tree representation from universal Hopf algebra of renormalization (in Connes-Marcolli's approach in the study of renormalizable Quantum Field Theories under the scheme minimal subtraction in…