Related papers: Proving Properties of $\varphi$-Representations wi…
Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…
We consider the task of automated theorem proving, a key AI task. Deep learning has shown promise for training theorem provers, but there are limited human-written theorems and proofs available for supervised learning. To address this…
The Herglotz representation theorem for holomorphic functions with non-negative real part is a fundamental result in the theory of holomorphic functions. In this paper, we reinterpret the Herglotz representation in the context of modern…
Interactive theorem provers have been used extensively to reason about various software/hardware systems and mathematical theorems. The key challenge when using an interactive prover is finding a suitable sequence of proof steps that will…
We prove that both local Galois representations and $(\varphi,\Gamma)$-modules can be recovered from prismatic F-crystals, from which we obtain a new proof of the equivalence of Galois representations and $(\varphi,\Gamma)$-modules.
Motivated by recent progress in operator representation of frames, we investigate the frames of the form $ \{T^n \varphi\}_{n\in I}$ for $ I=\mathbb{N}, \mathbb{Z} $, and answer questions about representations, perturbations and frames…
We illustrate the power of Experimental Mathematics and Symbolic Computation to suggest irrationality proofs of natural constants, and the determination of their irrationality measures. Sometimes such proofs can be fully automated, but…
In this paper, we consider the problem of learning a first-order theorem prover that uses a representation of beliefs in mathematical claims to construct proofs. The inspiration for doing so comes from the practices of human mathematicians…
We propose a matrix-free algorithm for evaluating linear combinations of $\varphi$-function actions, $w_i := \sum_{j=0}^{p} \alpha_i^{\,j}\,\varphi_j(t_i A)v_j$ for $i=1\colon r$, arising in exponential integrators. The method combines the…
We investigate interconnected aspects of hyperderivatives of polynomials over finite fields, q-th powers of polynomials, and specializations of Vandermonde matrices. We construct formulas for Carlitz multiplication coefficients using…
This paper from 2012 is the second in a series of three papers. All three papers deal with interpretability logics and related matters. In the first paper a construction method was exposed to obtain models of these logics. Using this…
Replacing operators with continuous operator-valued functions, we prove time-dependent versions of well-known results on compressions and diagonals of bounded operators. The setting of smooth functions is also addressed. Our results have no…
In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…
We prove that, under certain conditions on the function pair $\varphi_1$ and $\varphi_2$, bilinear average $p^{-1}\sum_{y\in \mathbb{F}_p}f_1(x+\varphi_1(y)) f_2(x+\varphi_2(y))$ along curve $(\varphi_1, \varphi_2)$ satisfies certain decay…
We show how to obtain, via a unified framework provided by logic and automata theory, many classical results of Brillhart and Morton on Rudin-Shapiro sums. The techniques also facilitate easy proofs for new results.
We establish a real version of Turrittin's result on polynomial and formal normal forms of linear systems of ODEs with meromorphic coefficients. Both the normal forms or the transformations used have only real coefficients. In order to…
We generalize permutative representations of the Cuntz algebras for the \cka\ $\coa$ for any $A$. We characterize cyclic permutative representations by notions of cycle and chain, and show their existence and uniqueness. We show necessary…
Describing complex phenomena by means of cellular automata (CA) has shown to be a very effective approach in pure and applied sciences. In fact, the number of published papers concerning this topic has tremendously increased over the last…
Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to…
In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].