English
Related papers

Related papers: An elementary proof of Bridy's theorem

200 papers

In this paper we use the Vandermonde matrices and their properties to give a new proof of the classical result of Karl Weierstrass about the approximation of continuous functions $f$ on closed intervals, using a sequence of polynomials. The…

Classical Analysis and ODEs · Mathematics 2025-07-02 José M. González Barrios , Alberto Contreras-Cristán , Patricia I. Romero-Mares

The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Michel Rigo , Manon Stipulanti

The diagonal of a multivariate power series F is the univariate power series Diag(F) generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and…

Symbolic Computation · Computer Science 2015-10-16 Alin Bostan , Louis Dumont , Bruno Salvy

In the framework of statistical mechanics the properties of macroscopic systems are deduced starting from the laws of their microscopic dynamics. One of the key assumptions in this procedure is the ergodic property, namely the equivalence…

Statistical Mechanics · Physics 2024-01-09 Marco Baldovin , Raffaele Marino , Angelo Vulpiani

A graph is chordal if it contains no induced cycle of length four or more. While finite chordal graphs are precisely those admitting tree-decompositions into cliques, this fails for infinite graphs. We establish two results extending the…

Combinatorics · Mathematics 2026-03-26 Max Pitz , Lucas Real , Roman Schaut

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

Logic in Computer Science · Computer Science 2018-10-11 Ruben Gamboa , John Cowles

Statistical learning theory is the foundation of machine learning, providing theoretical bounds for the risk of models learned from a (single) training set, assumed to issue from an unknown probability distribution. In actual deployment,…

Machine Learning · Computer Science 2024-10-25 Michele Caprio , Maryam Sultana , Eleni Elia , Fabio Cuzzolin

Finite-state dimension, introduced early in this century as a finite-state version of classical Hausdorff dimension, is a quantitative measure of the lower asymptotic density of information in an infinite sequence over a finite alphabet, as…

Information Theory · Computer Science 2023-05-11 Jack H. Lutz , Satyadev Nandakumar , Subin Pulari

This is an exposition, for pedagogical purposes, of the formal power series proof of Bostan, Christol and Dumas [3] of the result stated in the title (a corollary of the Christol theorem).

Combinatorics · Mathematics 2016-05-20 Martin Klazar

In a first part the scope of classical thermodynamics and statistical mechanics is discussed in the broader context of formal dynamical systems, including computer programmes. In this context classical thermodynamics appears as a particular…

Statistical Mechanics · Physics 2009-11-11 Daniel Pfenniger

Automatic sequences have many properties that other sequences (in particular, non-uniformly morphic sequences) do not necessarily share. In this paper we survey a number of different methods that can be used to prove that a given sequence…

Number Theory · Mathematics 2021-04-28 J. -P. Allouche , J. Shallit , R. Yassawi

Following the analysis of differentiable mappings of Y. Yomdin, M. Gromov has stated a very elegant "Algebraic Lemma" which says that the "differentiable size" of an algebraic subset may be bounded in terms only of its dimension, degree and…

Dynamical Systems · Mathematics 2007-05-23 David Burguet

Let $\psi$ be a sentence in the counting monadic second-order logic of matroids and let $\mathbb{F}$ be a finite field. Hlin\v{e}n\'{y}'s Theorem says that we can test whether $\mathbb{F}$-representable matroids satisfy $\psi$ using an…

Combinatorics · Mathematics 2023-06-28 Daryl Funk , Dillon Mayhew , Mike Newman

Let $p(x) \in C(x)$ be a rational function satisfying the condition $p(0)=1$ and $q$ an integer larger than $1$, in this article we will consider the power expansion of the infinite product…

Number Theory · Mathematics 2019-11-28 Shuo Li

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Rings and Algebras · Mathematics 2023-07-14 Libor Barto , Antoine Mottet

A variety of associative algebras over a field of characteristic 0 is called minimal if its codimension sequence grows much faster than the codimension sequence of any of its proper subvarieties. By the results of Giambruno and Zaicev it…

Rings and Algebras · Mathematics 2020-04-21 Vesselin Drensky

We prove an analogue of the celebrated Hall-Higman theorem, which gives a lower bound for the degree of the minimal polynomial of any semisimple element of prime power order $p^{a}$ of a finite classical group in any nontrivial irreducible…

Representation Theory · Mathematics 2008-10-07 Pham Huu Tiep , Alexander E. Zalesskii

In the field of parameterized complexity theory, the study of graph width measures has been intimately connected with the development of width-based model checking algorithms for combinatorial properties on graphs. In this work, we…

Data Structures and Algorithms · Computer Science 2026-05-21 Mateus de Oliveira Oliveira , Sam Urmian

We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…

Dynamical Systems · Mathematics 2012-02-23 Nikos Frantzikinakis

In this note we draw a connection between noncommutative algebra and geometric group theory. Specifically, we ask whether it is possible to bound the sequence of codimensions for an associative PI-algebra using techniques from geometric…

Rings and Algebras · Mathematics 2016-01-05 Christopher S. Henry
‹ Prev 1 3 4 5 6 7 10 Next ›