2,707 research outputs found
Functional relations for elliptic polylogarithms
Numerous examples of functional relations for multiple polylogarithms are known. For elliptic polylogarithms, however, tools for the exploration of functional relations are available, but only very few relations are identified. Starting from an approach of Zagier and Gangl, which in turn is based on considerations about an elliptic version of the Bloch group, we explore functional relations between elliptic polylogarithms and link them to the relations which can be derived using the elliptic symbol formalism. The elliptic symbol formalism in turn allows for an alternative proof of the validity of the elliptic Bloch relation. While the five-term identity is the prime example of a functional identity for multiple polylogarithms and implies many dilogarithm identities, the situation in the elliptic setup is more involved: there is no simple elliptic analogue, but rather a whole class of elliptic identities
Applications of Automata and Graphs: Labeling-Operators in Hilbert Space I
We show that certain representations of graphs by operators on Hilbert space
have uses in signal processing and in symbolic dynamics. Our main result is
that graphs built on automata have fractal characteristics. We make this
precise with the use of Representation Theory and of Spectral Theory of a
certain family of Hecke operators. Let G be a directed graph. We begin by
building the graph groupoid G induced by G, and representations of G. Our main
application is to the groupoids defined from automata. By assigning weights to
the edges of a fixed graph G, we give conditions for G to acquire fractal-like
properties, and hence we can have fractaloids or G-fractals. Our standing
assumption on G is that it is locally finite and connected, and our labeling of
G is determined by the "out-degrees of vertices". From our labeling, we arrive
at a family of Hecke-type operators whose spectrum is computed. As
applications, we are able to build representations by operators on Hilbert
spaces (including the Hecke operators); and we further show that automata built
on a finite alphabet generate fractaloids. Our Hecke-type operators, or
labeling operators, come from an amalgamated free probability construction, and
we compute the corresponding amalgamated free moments. We show that the free
moments are completely determined by certain scalar-valued functions.Comment: 69 page
Propagators and Solvers for the Algebra of Modular Systems
To appear in the proceedings of LPAR 21.
Solving complex problems can involve non-trivial combinations of distinct
knowledge bases and problem solvers. The Algebra of Modular Systems is a
knowledge representation framework that provides a method for formally
specifying such systems in purely semantic terms. Formally, an expression of
the algebra defines a class of structures. Many expressive formalism used in
practice solve the model expansion task, where a structure is given on the
input and an expansion of this structure in the defined class of structures is
searched (this practice overcomes the common undecidability problem for
expressive logics). In this paper, we construct a solver for the model
expansion task for a complex modular systems from an expression in the algebra
and black-box propagators or solvers for the primitive modules. To this end, we
define a general notion of propagators equipped with an explanation mechanism,
an extension of the alge- bra to propagators, and a lazy conflict-driven
learning algorithm. The result is a framework for seamlessly combining solving
technology from different domains to produce a solver for a combined system.Comment: To appear in the proceedings of LPAR 2
- …