Related papers: On repetitive right application of B-terms
A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…
A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…
We characterize the spectrum (and its parts) of operators which can be represented as G=A+BC for a simpler operator A and a structured perturbation BC. The interest in this kind of perturbations is motivated, e.g., by perturbations of the…
We prove an intermediate value theorem of an arithmetical flavor, involving the consecutive averages of sequences with terms in a given finite set A. For every such set we completely characterize the numbers x ("intermediate values") with…
The BRST formulation is used in order to derive the existence criterion for classical bi-Hamiltonian systems, based on non-anomalous deformation of the gauge-fixing structure. The recursion operator is then used to provide the entire…
Representing a word by its co-occurrences with other words in context is an effective way to capture the meaning of the word. However, the theory behind remains a challenge. In this work, taking the example of a word classification task, we…
We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…
Let C be a closed subset of a topological space X, and let f : C --> X. Let us assume that f is continuous and f(x) lies in C for every x in the boundary of C. How many times can one iterate f? This paper provides estimates on the number of…
Boyer and Moore have discussed a recursive function that puts conditional expressions into normal form [1]. It is difficult to prove that this function terminates on all inputs. Three termination proofs are compared: (1) using a measure…
We address the problem of verifying k-safety properties: properties that refer to k-interacting executions of a program. A prominent way to verify k-safety properties is by self composition. In this approach, the problem of checking…
The famous J.C.P. Miller formula provides a recurrence algorithm for the composition $B_a \circ f$, where $B_a$ is the formal binomial series and $f$ is a formal power series, however it requires that $f$ has to be a nonunit. In this paper…
Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point…
We use the octahedron recurrence to give a simplified statement and proof of a formula for iterated birational rowmotion on a product of two chains, first described by Musiker and Roby. Using this, we show that weights of certain chains in…
The first and second representation theorems for sign-indefinite, not necessarily semi-bounded quadratic forms are revisited. New straightforward proofs of these theorems are given. A number of necessary and sufficient conditions ensuring…
Functional analysis, especially the theory of Hilbert spaces and of operators on these, form an important area in mathematics. We formalized the Isabelle/HOL library Complex_Bounded_Operators containing a large amount of theorems about…
We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical conjectures such as Bouniakowsky's provide necessary…
We investigate systems of the form $\{A^tg:g\in\mathcal{G},t\in[0,L]\}$ where $A \in B(\mathcal{H})$ is a normal operator in a separable Hilbert space $\mathcal{H}$, $\mathcal{G}\subset \mathcal{H}$ is a countable set, and $L$ is a positive…
Using multisets, we develop novel techniques for mechanizing the proofs of the synthesis conjectures for list-sorting algorithms, and we demonstrate them in the Theorema system. We use the classical principle of extracting the algorithm as…
A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for specifying and reasoning about algorithms that manipulate mathematical…
We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…