相关论文: About a resolvent formula

We describe the structure of the resolvent of the discrete rough truncated Hilbert transform under the critical exponent. This extends the results obtained in [8].

We take the perspective of an advanced high school student trying to understand the proof of Fermat's Last Theorem for the first time. We collect definitions and statements needed to summarise how Fermat's Last Theorem was first proved in…

Pausinger recently investigated a special determinant involving prime numbers. In this short note we point out that this type of determinants was already known in linear algebra and its computation is unrelated to prime numbers.

Wigner limits are given formally as the difference between a lattice sum, associated to a positive definite quadratic form, and a corresponding multiple integral. To define these limits, which arose in work of Wigner on the energy of static…

A set of equations is developed to describe a curve in space given the curvature $\kappa$ and the angle of rotation $\theta$ of the osculating plane. The set of equations has a solution (in terms of $\kappa$ and $\theta$) that indirectly…

In this expository note, we compute the exact value of the norm of the resolvent of the Volterra operator.

The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…

The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the…

We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq.

We consider the Izergin-Korepin determinant [1] together with another determinant which was invented by Kuperberg [2]. He used these determinants to prove a formula for the total number of half-turn symmetric alternating sign matrices of…

In accelerator physics, the concept of impedance is popularly used to describe the interactions of charged particles inside a bunch or between bunches in a train. Standard formulations of impedance assume that the driving charge has a…

This paper considers an idempotent and symmetrical algebraic structure as well as some closely related concept. A special notion of determinant is introduced and a Cramer formula is derived for a class of limit systems derived from the…

The Lambert $W$ function, giving the solutions of a simple transcendental equation, has become a famous function and arises in many applications in combinatorics, physics, or population dyamics just to mention a few. In the last decade it…

The Bertrand's theorem can be formulated as the solution of an inverse problem for a classical unidimensional motion. We show that the solutions of these problems, if restricted to a given class, can be obtained by solving a numerical…

Within convex analysis, a rich theory with various applications has been evolving since the proximal average of convex functions was first introduced over a decade ago. When one considers the subdifferential of the proximal average, a…

In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…

The molecule solution of an equation related to the lattice Boussinesq equation is derived with the help of determinantal identities. It is shown that this equation can for certain sequences be used as a numerical convergence acceleration…

We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…

Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs…

We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…