Related papers: Automatic Logarithm and Associated Measures

This paper studies tree-automatic ordinals (or equivalently, well-founded linearly ordered sets) together with the ordinal addition operation +. Informally, these are ordinals such that their elements are coded by finite trees for which the…

We present two new hybrid techniques that replace the synchronized product used in the automata-theoretic approach for LTL model checking. The proposed products are explicit graphs of aggregates (symbolic sets of states) that can be…

Given a finite Borel measure $\mu$ on R n and basic semi-algebraic sets $\Omega$\_i $\subset$ R n , i = 1,. .. , p, we provide a systematic numerical scheme to approximate as closely as desired $\mu$(\cup\_i $\Omega$\_i), when all moments…

In this contribution I discuss a recent proposal of a novel action for lattice gauge theory for finite systems, which accommodates non-periodic spatial boundary conditions. Drawing on the summation-by-parts formulation of finite differences…

Given a model of the theory of the real field with restricted analytic functions such that its value group has finite archimedean rank we show how one can extend the restricted logarithm to a global logarithm with values in the polynomial…

The S-metric has grown popular in network studies, as a measure of ``scale-freeness'' restricted to the collection G(D) of connected graphs with a common degree sequence D=(d_1,\ldots,d_n). The calculation of S depends on the maximum…

The majority of existing Linear Temporal Logic (LTL) planning methods rely on the construction of a discrete product automaton, that combines a discrete abstraction of robot mobility and a B$\ddot{\text{u}}$chi automaton that captures the…

Let $G$ be a topological group and let $\mu$ be the Lebesgue measure on the interval $[0,1]$. We let $L_0(G)$ to be the topological group of all $\mu$-equivalence classes of $\mu$-measurable functions defined on [0,1] with values in $G$,…

The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…

We consider finite two-way automata and measure the use of two-way motion by counting the number of left moves in accepting computations. Restriction of the automata according to this measure allows us to study in detail the use of two-way…

For a finite abelian p-group A of rank d, we define its (logarithmic) mean exponent to be the base-p logarithm of the d-th root of its cardinality. We study the behavior of the mean exponent of p-class groups in towers of number fields. By…

We describe a numerical technique to compute the equilibrium measure, in logarithmic potential theory, living on the attractor of Iterated Function Systems composed of one-dimensional affine maps. This measure is obtained as the limit of a…

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs.…

The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such…

We demonstrate that the integrality gap of the natural cut-based LP relaxation for the directed Steiner tree problem is $O(\log k)$ in quasi-bipartite graphs with $k$ terminals. Such instances can be seen to generalize set cover, so the…

The automorphism group $Aut(X,\mu)$ of a compact, complete metric space $X$ with a Radon measure $\mu$ is a subgroup of $\mathcal{U}(L^2(X,\mu))$-the unitary group of operators on $L^2(X,\mu)$. The $Aut(X,\mu)$-action on the generalized…

Let P -> M be a principal G-bundle. Using techniques from the loop representation of gauge theory, we construct well-defined substitutes for ``Lebesgue measure'' on the space A of connections on P and for ``Haar measure'' on the group Ga of…

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…

Let $\underline{\mathcal F}$ be a $\tau$-sheaf. Building on previous work of Drinfeld, Anderson, Taguchi, and Wan, B\"ockle and Pink \cite{bp1} develop a cohomology theory for $\underline{\mathcal F}$. In \cite{boc1} B\"ockle uses this…