A generalization of Euler’s constant

The purpose of this paper is to evaluate the limit γ(a) of the sequence , where a ∈ (0, + ∞ ).      

A geometric approach to Euler’s addition formula

Plane quartic curves given by equations of the form y ²=P(x) with polynomials P of degree 4 represent singular models of elliptic curves which are directly related to elliptic integrals in the form studied by Euler and for which he developed his famous addition formulas. For cubic curves, the well-known secant and tangent construction establishes an immediate connection of addition formulas for the corresponding elliptic integrals with the structure of an algebraic group. The situation for quartic curves is considerably more complicated due to the presence of the singularity. We present a geometric construction, similar in spirit to the secant method for cubic curves, which defines an addition law on a quartic elliptic curve given by rational functions. Furthermore, we show how this addition on the curve itself corresponds to the addition in the (generalized) Jacobian variety of the curve, and we show how any addition formula for elliptic integrals of the form \(\int (1/\sqrt{P(x)})\,\mathrm{d}x\) with a quartic polynomial P can be derived directly from this addition law.     

On a new constant related to Euler’s constant

This paper introduces a new constant \(\kappa \), with a definition closely related to that of the Euler–Mascheroni’s constant \(\gamma \). Some integrals and infinite sums are evaluated in terms of \(\kappa \).     

Application of Padé Approximation to Euler’s constant and Stirling’s formula

The Ramanujan Journal - The Digamma function $$\varGamma '/\varGamma $$ admits a well-known (divergent) asymptotic expansion involving the Bernoulli numbers. Using Touchard-type orthogonal...     

A variant of Davenport’s constant

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of ]n[≔ {1, 2,…, n} such that elements of A are incongruent modulo p and non-zero modulo p. Let k ≥ D(G/|A| be any integer where D(G) denotes the well-known Davenport’s constant. In this article, we prove that for any sequence g ₁, g ₂,…, g _k (not necessarily distinct) in G, one can always extract a subsequence with 1 ≤ ℓ ≤ k such that

Janet’s approach to presentations and resolutions for polynomials and linear pdes

Janets algorithm to create normal forms for systems of linear pdes is outlined and used as a tool to construct resolutions for finitely generated modules over polynomial rings over fields as well as over rings of linear differential operators with coefficients in a differential field. The main result is that a Janet basis for a module allows to read off a Janet basis for the syzygy module. Two concepts are introduced: The generalized Hilbert series allowing to read off a basis (over the ground field) of the modules, once the Janet basis is constructed, and the Janet graph, containing all the relevant information connected to the Janet basis. In the context of pdes, the generalized Hilbert series enumerates the free Taylor coefficients for power series solutions. Rather than presenting Janets algorithm as a powerful computational tool competing successfully with more commonly known Gröbner basis techniques, it is used here to prove theoretical results.Received: 6 September 2004     

Optimal control approach to stability criteria on Hill’s equations

This paper gives a tutorial on how to prove Lyapunov type criteria by optimal control methods. Firstly, we consider stability criteria on Hill's equations with nonnegative potential. By optimal control methods developed in 1990s, we obtain several stability criteria including Lyapunov's criterion, Neǐgauz and Lidskiǐ's criterion. Secondly, we present stability criteria on Hill's equations with sign-changing potential in which Brog's criterion and Krein's criterion are included.     

Generalizations of Arnold’s version of Euler’s theorem for matrices

A recent result, conjectured by Arnold and proved by Zarelua, states that for a prime number p, a positive integer k, and a square matrix A with integral entries one has ${\textrm tr}(A^{p^k}) \equiv {\textrm tr}(A^{p^{k-1}}) ({\textrm mod}{p^k})${\textrm tr}(A^{p^k}) \equiv {\textrm tr}(A^{p^{k-1}}) ({\textrm mod}{p^k}). We give a short proof of a more general result, which states that if the characteristic polynomials of two integral matrices A,  B are congruent modulo p ^k then the characteristic polynomials of A ^p and B ^p are congruent modulo p ^k+1, and then we show that Arnold’s conjecture follows from it easily. Using this result, we prove the following generalization of Euler’s theorem for any 2 × 2 integral matrix A: the characteristic polynomials of A ^Φ(n) and A ^Φ(n)-ϕ(n) are congruent modulo n. Here ϕ is the Euler function, ?_i=1^l p_i^a_i\prod_{i=1}^{l} p_i^{\alpha_i} is a prime factorization of n and $\Phi(n)=(\phi(n)+\prod_{i=1}^{l} p_i^{\alpha_i-1}(p_i+1))/2$\Phi(n)=(\phi(n)+\prod_{i=1}^{l} p_i^{\alpha_i-1}(p_i+1))/2.     

A new approach to Sheppard’s corrections

A very simple closed-form formula for Sheppard’s corrections is recovered by means of the classical umbral calculus. Using this symbolic method, a more general closed-form formula for discrete parent distributions is provided and the generalization to the multivariate case turns out to be straightforward. All these new formulas are particularly suited to be implemented in any symbolic package.     

A Galois-theoretic approach to Kanev’s correspondence

Let G be a finite group, an absolutely irreducible -module and w a weight of . To any Galois covering with group G we associate two correspondences, the Schur and the Kanev correspondence. We work out their relation and compute their invariants. Using this, we give some new examples of Prym–Tyurin varieties. This work was supported by FONDECYT No. 11060468 and No. 1060742.     

A relaxation approach to hencky’s plasticity

Givenμ, κ, c>0, we consider the functional

Hardy’s theorem for zeta-functions of quadratic forms

LetQ(u ₁,…,u ₁) =Σd _ij u _i u _j (i,j = 1 tol) be a positive definite quadratic form inl(≥3) variables with integer coefficientsd _ij (=d _ji ). Puts=σ+it and for σ>(l/2) write $$Z_Q (s) = \Sigma '(Q(u_1 ,...,u_l ))^{ - s} ,$$ where the accent indicates that the sum is over alll-tuples of integer (u ₁,…,u _l ) with the exception of (0,…, 0). It is well-known that this series converges for σ>(l/2) and that (s-(l/2))Z _Q (s) can be continued to an entire function ofs. Let σ be any constant with 0<σ<1/100. Then it is proved thatZ _Q (s)has ?_δTlogT zeros in the rectangle(|σ-1/2|≤δ, T≤t≤2T).     

A variety of Euler’s sum of powers conjecture

Czechoslovak Mathematical Journal - We consider a variety of Euler’s sum of powers conjecture, i.e., whether the Diophantine system $$left{{matrix{{n = {a_1} + {a_2} + ldots + {a_{s -...     

Extension of Euler’s method to parabolic equations

Euler generalized d’Alembert’s solution to a wide class of linear hyperbolic equations with two independent variables. He introduced in 1769 the quantities that were rediscovered by Laplace in 1773 and became known as the Laplace invariants. The present paper is devoted to an extension of Euler’s method to linear parabolic equations with two independent variables. The new method allows one to derive an explicit formula for the general solution of a wide class of parabolic equations. In particular, the general solution of the Black–Scholes equation is obtained.     

A new combinatorial approach to the construction of constant composition codes

Constant composition codes(CCCs)are a new generalization of binary constant weight codes and have attracted recent interest due to their numerous applications. In this paper, a new combinatorial approach to the construction of CCCs is proposed, and used to establish new optimal CCCs.     

Systems of second-order linear ODE’s with constant coefficients and their symmetries

Starting from the study of the symmetries of systems of 4 second-order linear ODEs with constant real coefficients, we determine the dimension and generators of the symmetry algebra for systems of n equations described by a diagonal Jordan canonical form. We further prove that some dimensions between the lower and upper bounds cannot be attained in the diagonal case, and classify the Levi factors of the symmetry algebras.     

Sets of monotonicity for Euler’s totient function

We study subsets of [1,x] on which the Euler φ-function is monotone (nondecreasing or nonincreasing). For example, we show that for any ?>0, every such subset has size smaller than ?x, once x>x ₀(?). This confirms a conjecture of the second author.     

A species approach to Rota’s twelvefold way

An introduction to Joyal’s theory of combinatorial species is given and through it an alternative view of Rota’s twelvefold way emerges.     

Cayley’s hyperdeterminant: A combinatorial approach via representation theory

Cayley’s hyperdeterminant is a homogeneous polynomial of degree 4 in the 8 entries of a $2\times 2\times 2$ array. It is the simplest (nonconstant) polynomial which is invariant under changes of basis in three directions. We use elementary facts about representations of the 3-dimensional simple Lie algebra $\mathfrak{s}{l}_2(\mathbb{C})$ to reduce the problem of finding the invariant polynomials for a $2\times 2\times 2$ array to a combinatorial problem on the enumeration of $2\times 2\times 2$ arrays with non-negative integer entries. We then apply results from linear algebra to obtain a new proof that Cayley’s hyperdeterminant generates all the invariants. In the last section we discuss the application of our methods to general multidimensional arrays.