English
Related papers

Related papers: Bernoulli measure on strings, and Thompson-Higman …

200 papers

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…

Information Theory · Computer Science 2020-10-19 Pavel Loskot

The Thompson-Higman groups G_{k,i} have a natural generalization to monoids M_{k,i}, and inverse monoids Inv_{k,i}. We study some structural features of M_{k,i} and Inv_{k,i} and investigate the computational complexity of decision…

Group Theory · Mathematics 2009-04-17 Jean-Camille Birget

Measures play an important role in the characterisation of various function spaces. In this paper, the structure of density measures will be investigated. These are elements of the dual of the space of essentially bounded func- tions. The…

Metric Geometry · Mathematics 2017-10-09 Moritz Schönherr , Friedemann Schuricht

Using the notion of higher-order Fourier dimension introduced in \cite{M2} (which was a sort of psuedorandomness condition stemming from the Gowers norms of Additive Combinatorics), we prove a maximal theorem and corresponding…

Classical Analysis and ODEs · Mathematics 2013-08-16 Marc Carnovale

Let m be a unidimensional measure with dimension d. A natural question is to ask if the measure m is comparable with the Hausdorff measure (or the packing measure) in dimension d. We give an answer (which is in general negative) to this…

Probability · Mathematics 2010-04-12 Imen Bhouri , Yanick Heurteaux

We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic…

Logic in Computer Science · Computer Science 2024-02-14 Elena Di Lavore , Paweł Sobociński

The use of a non-Riemannian measure of integration in the action of strings and branes allows the possibility of dynamical tension. In particular, lower dimensional objects living in the string/brane can induce discontinuities in the…

High Energy Physics - Theory · Physics 2009-11-11 Stefano Ansoldi , Eduardo I. Guendelman , Euro Spallucci

One can consider $\mu$-Martin-L\"of randomness for a probability measure $\mu$ on $2^{\omega}$, such as the Bernoulli measure $\mu_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^{\omega}$ with parameters $p_0,…

Logic · Mathematics 2020-11-30 Andrew DeLapo

We define the notion of Bernstein measures and Bernstein approximations over general convex polytopes. This generalizes well-known Bernstein polynomials which are used to prove the Weierstrass approximation theorem on one dimensional…

Functional Analysis · Mathematics 2017-11-15 Tatsuya Tate

Detecting and measuring repetitiveness of strings is a problem that has been extensively studied in data compression and text indexing. However, when the data are structured in a non-linear way, like in the context of two-dimensional…

Data Structures and Algorithms · Computer Science 2024-04-11 Giuseppe Romana , Marinella Sciortino , Cristian Urbina

Let $d\nu$ be a measure in $\mathbb{R}^d$ obtained from adding a set of mass points to another measure $d\mu$. Orthogonal polynomials in several variables associated with $d\nu$ can be explicitly expressed in terms of orthogonal polynomials…

Classical Analysis and ODEs · Mathematics 2009-11-17 A. M. Delgado , L. Fernandez , T. E. Perez , M. A. Pinar , Y. Xu

In this work we apply the techniques that were developed in [Lalin: An algebraic integration for Mahler measure] in order to study several examples of multivariable polynomials whose Mahler measure is expressed in terms of special values of…

Number Theory · Mathematics 2008-04-03 Matilde N. Lalin

In this survey paper, I first review the history of Bernoulli numbers, then examine the modern definition of Bernoulli numbers and the appearance of Bernoulli numbers in expansion of functions. I revisit some properties of Bernoulli numbers…

History and Overview · Mathematics 2007-05-23 Lin Cong

We propose a measure of shape which is appropriate for the study of a complicated geometric structure, defined using the topology of neighborhoods of the structure. One aspect of this measure gives a new notion of fractal dimension. We…

Algebraic Topology · Mathematics 2010-12-20 Robert MacPherson , Benjamin Schweinhart

We introduce and study strongly and weakly harmonic functions on metric measure spaces defined via the mean value property holding for all and, respectively, for some radii of balls at every point of the underlying domain. Among properties…

Metric Geometry · Mathematics 2016-01-18 Tomasz Adamowicz , Michał Gaczkowski , Przemysław Górka

We study the asymptotic density of the set of subscripts of the Bernoulli numbers having a given denominator. We also study the distribution of distinct Bernoulli denominators and some related problems.

Number Theory · Mathematics 2021-11-02 Carl Pomerance , Samuel S. Wagstaff

We consider a generalization of the Mahler measure of a multivariable polynomial $P$ as the integral of $\log^k|P|$ in the unit torus, as opposed to the classical definition with the integral of $\log|P|$. A zeta Mahler measure, involving…

Number Theory · Mathematics 2009-08-04 Nobushige Kurokawa , Matilde Lalin , Hiroyuki Ochiai

In string-bit models, string is described as a polymer of point-like constituents. We attempt to use string-bit ideas to investigate how the size of string is affected by string interactions in a non-perturbative context. Lacking adequate…

High Energy Physics - Theory · Physics 2009-10-30 O. Bergman , C. B. Thorn

We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…

Computational Complexity · Computer Science 2020-10-16 Neta Dafni , Yuval Filmus , Noam Lifshitz , Nathan Lindzey , Marc Vinyals