Related papers: On B. Moss\'e's unilateral recognizability theorem
We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…
Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We show that one can always identify a point on an algebraic variety $X$ uniquely with $\dim X +1$ generic linear measurements taken themselves from a variety under minimal assumptions. As illustrated by several examples the result is…
In this note, we show that Binomial theorem and Chu-Vandermonde convolution can both be verified by the finite difference method.
We prove irreducibility and mutual inequivalence for certain unitary representations of R. Thompson's groups F and T.
In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…
In this short note a new proof of the monotone con- vergence theorem of Lebesgue integral on \sigma-class is given.
In this note, using the derangement polynomials and their umbral representation, we give another simple proof of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory.
We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
We give a proof of a Martingale Representation Theorem using the methods of nonstandard analysis.
Some practical results are derived for population inference based on a sample, under the two qualitative conditions of 'ignorability' and exchangeability. These are the 'Histogram Theorem', for predicting the outcome of a non-sampled member…
We give a new proof of the decidability of reachability in alternating pushdown systems, showing that it is a simple consequence of a cut-elimination theorem for some natural-deduction style inference systems. Then, we show how this result…
Given a singular modulus $j_0$ and a set of rational primes $S$, we study the problem of effectively determining the set of singular moduli $j$ such that $j-j_0$ is an $S$-unit. For every $j_0 \neq 0$, we provide an effective way of finding…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
We prove that a completely non-degenerate B-group is uniquely determined by its factor: two such groups with conformally equivalent factors are M\"obius conjugate. A similar property is inherent to the quasi-Fuchsian groups but not to…
We survey the classical results on the prime number theorem
Utilising some recent ideas from our bilinear bi-parameter theory, we give an efficient proof of a two-weight Bloom type inequality for iterated commutators of linear bi-parameter singular integrals. We prove that if $T$ is a bi-parameter…
We prove that the codes issued from the elimination of any subalphabet in a trace monoid are finite state recognizable. This implies in particular that the transitive factorizations of the trace monoids are recognizable by (boolean)…