Sporadic sequences, modular forms and new series for 1/π

Two new sequences, which are analogues of six sporadic examples of D.?Zagier, are presented. The connection with modular forms is established and some new series for 1/?? are deduced. The experimental procedure that led to the discovery of these results is recounted. Proofs of the main identities will be given, and some congruence properties that appear to be satisfied by the sequences will be stated as conjectures.     

A note on Schanuel’s conjectures for exponential logarithmic power series fields

In Ax (Ann. Math. 93(2):252–268, 1971), J. Ax proved a transcendency theorem for certain differential fields of characteristic zero : the differential counterpart of the still open Schanuel conjecture about the exponential function over ${\mathbb{C}}$ (Lang, Introduction to transcendental numbers, 1966). In this article, we derive from Ax’s theorem transcendency results in the context of differential valued exponential fields. In particular, we obtain results for exponential Hardy fields, Logarithmic-Exponential power series fields, and Exponential-Logarithmic power series fields.     

Eisenstein series and Ramanujan-type series for 1/π

Using certain representations for Eisenstein series, we uniformly derive several Ramanujan-type series for 1/π.     

Wiener’s and Lévy’s theorems for some weighted power series

We obtain weighted version of the classical theorems of Wiener and Lévy on absolutely convergent power series.     

Some reduction formulae for double power series and Kampé de Fériet functions

Application of suitable ₄F₃[1] summation theorems leads to a number of formulae expressing certain double power series with equal variables as single power series. These formulae yield as particular cases reduction formulae expressing Kampé de Fériet functions F_q:1:1^p:2:2[X,X] with certain parameter conditions in terms of either _p+3F_q+2[X] or _p+2F_q+1[X].     

Improved estimates on majorizing sequences for the Newton–Kantorovich method

We approximate a locally unique solution of an equation in Banach space using the Newton–Kantorovich method. Motivated by our earlier works (see references [2–7] in the references list), optimization consideration, and the elegant studies by Cianciaruso with DePascale in (Numer. Funct. Anal. Optim. 27(5–6):529–538, 2006), and Cianciaruso in (Nonlinear Funct. Anal. Appl., 2009, to appear), we provide (by using more precise error estimates on the distances involved): finer error bounds; an at least as precise information on the location of the solution, and a larger convergence domain than in (Numer. Funct. Anal. Optim. 27(5–6):529–538, 2006). Finally, we provide numerical examples where our results can apply to solve equations, but earlier ones can not (see references [8–19]).     

Numerical semigroups: Apéry sets and Hilbert series

Let a ₁,…,a _n be relatively prime positive integers, and let S be the semigroup consisting of all non-negative integer linear combinations of a ₁,…,a _n . In this paper, we focus our attention on AA-semigroups, that is semigroups being generated by almost arithmetic progressions. After some general considerations, we give a characterization of the symmetric AA-semigroups. We also present an efficient method to determine an Apéry set and the Hilbert series of an AA-semigroup. Dedicated to the memory of Ernst S. Selmer (1920–2006), whose calculations revealed the “Selmer group”.     

On Λ2-strong convergence of numerical sequences and Fourier series

We introduce the Λ²-strong convergence of numerical sequences and with it we generalize the concept of Λ-strong convergence of the results published by F. Móricz [2].     

A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing

The three-dimensional bin packing problem consists of packing a set of boxes into the minimum number of bins. In this paper we propose a new GRASP algorithm for solving three-dimensional bin packing problems which can also be directly applied to the two-dimensional case. The constructive phase is based on a maximal-space heuristic developed for the container loading problem. In the improvement phase, several new moves are designed and combined in a VND structure. The resulting hybrid GRASP/VND algorithm is simple and quite fast and the extensive computational results on test instances from the literature show that the quality of the solutions is equal to or better than that obtained by the best existing heuristic procedures.     

Dedekind–Mertens lemma and content formulas in power series rings

Let $R?X?$ be the power series ring over a commutative ring R with identity. For $f\in R?X?$, let $A_f$ denote the content ideal of f, i.e., the ideal of R generated by the coefficients of f. We show that if R is a Prüfer domain and if $g\in R?X?$ such that $A_g$ is locally finitely generated (or equivalently locally principal), then a Dedekind–Mertens type formula holds for g, namely $A_f^2{A}_g=A_f{A}_{fg}$ for all $f\in R?X?$. More generally for a Prüfer domain R, we prove the content formula ${(A_f{A}_g)}^2=(A_f{A}_g)A_{fg}$ for all $f,g\in R?X?$. As a consequence it is shown that an integral domain R is completely integrally closed if and only if ${(A_f{A}_g)}_v={(A_{fg})}_v$ for all nonzero $f,g\in R?X?$, which is a beautiful result corresponding to the well-known fact that an integral domain R is integrally closed if and only if ${(A_f{A}_g)}_v={(A_{fg})}_v$ for all nonzero $f,g\in R[X]$, where $R[X]$ is the polynomial ring over R.For a ring R and $g\in R?X?$, if $A_g$ is not locally finitely generated, then there may be no positive integer k such that $A_f^{k+1}{A}_g=A_f^k{A}_{fg}$ for all $f\in R?X?$. Assuming that the locally minimal number of generators of $A_g$ is $k+1$, Epstein and Shapiro posed a question about the validation of the formula $A_f^{k+1}{A}_g=A_f^k{A}_{fg}$ for all $f\in R?X?$. We give a negative answer to this question and show that the finiteness of the locally minimal number of special generators of $A_g$ is in fact a more suitable assumption. More precisely we prove that if the locally minimal number of special generators of $A_g$ is $k+1$, then $A_f^{k+1}{A}_g=A_f^k{A}_{fg}$ for all $f\in R?X?$. As a consequence we show that if $A_g$ is finitely generated (in particular if $g\in R[X]$), then there exists a nonnegative integer k such that $A_f^{k+1}{A}_g=A_f^k{A}_{fg}$ for all $f\in R?X?$.     

A Reilly Formula and Eigenvalue Estimates for Differential Forms

We derive a Reilly-type formula for differential p-forms on a compact manifold with boundary and apply it to give a sharp lower bound of the spectrum of the Hodge Laplacian acting on differential forms of an embedded hypersurface of a Riemannian manifold. The equality case of our inequality gives rise to a number of rigidity results, when the geometry of the boundary has special properties and the domain is non-negatively curved. Finally, we also obtain, as a byproduct of our calculations, an upper bound of the first eigenvalue of the Hodge Laplacian when the ambient manifold supports non-trivial parallel forms.     

Dihedral quartic approximations and series for π

Imaginary quadratic fields with class groups that have C(4) as a subgroup are analyzed in depth, and the units of associated dihedral quartic fields are thereby evaluated using Epstein zeta functions. Emphasis is placed on extreme examples such as Q(√?3502) which is probably the last case having an even discriminant and C(4) × C(4) as its class group. These extreme examples lead to very remarkable approximations and series for π such as

$\text{π=}\text{6}\text{3502}\text{log}\text{(2π)+7.37×10}{}^{\mathrm{?82}}$

where u is the product of four, rather simple, quartic units. The approximations and series relate to Baker's theory of linear forms in logarithms and to certain modular identities. Related topics are discussed briefly.     

Optimization of SVM parameters for recognition of regulatory DNA sequences

Identification and recognition of specific functionally-important DNA sequence fragments such as regulatory sequences are considered the most important problems in bioinformatics. One type of such fragments are promoters, i.e., short regulatory DNA sequences located upstream of a gene. Detection of regulatory DNA sequences is important for successful gene prediction and gene expression studies. In this paper, Support Vector Machine (SVM) is used for classification of DNA sequences and recognition of the regulatory sequences. For optimal classification, various SVM learning and kernel parameters (hyperparameters) and their optimization methods are analyzed. In a case study, optimization of the SVM hyperparameters for linear, polynomial and power series kernels is performed using a modification of the Nelder–Mead (downhill simplex) algorithm. The method allows for improving the precision of identification of the regulatory DNA sequences. The results of promoter recognition for the drosophila sequence datasets are presented.     

A study of Schröder’s method for the matrix pth root using power series expansions

Numerical Algorithms - When A is a matrix with all eigenvalues in the disk |z - 1| < 1, the principal pth root of A can be computed by Schröder’s method, among many other methods....     

Padé approximations to certain power series

Summary An explicit identity involvingQ _n (q ⁱ z) (i = 0, 1,, 4) is shown, whereQ _n (z) is the denominator of thenth Padé approximant to the functionf(z) = _k=0 q ^1/2k(k–1 Z ^k . By using the Padé approximations, irrationality measures for certain values off(z) are also given.

     

Fréchet algebras,formal power series,and analytic structure

The notion of locally Riemann algebras is introduced. By studying the ideal structure of Fréchet algebras, we provide sufficient conditions for the existence of local analytic structure in the spectrum of a Fréchet algebra, and, as a welcome bonus, we characterize locally Riemann algebras.     

A globally and quadratically convergent method for absolute value equations

We investigate the NP-hard absolute value equation (AVE) Ax−|x|=b, where A is an arbitrary n×n real matrix. In this paper, we propose a smoothing Newton method for the AVE. When the singular values of A exceed 1, we show that this proposed method is globally convergent and the convergence rate is quadratic. Preliminary numerical results show that this method is promising.     

A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem

In this paper, we propose a new hybrid algorithm for the Hamiltonian cycle problem by synthesizing the Cross Entropy method and Markov decision processes. In particular, this new algorithm assigns a random length to each arc and alters the Hamiltonian cycle problem to the travelling salesman problem. Thus, there is now a probability corresponding to each arc that denotes the probability of the event “this arc is located on the shortest tour.” Those probabilities are then updated as in cross entropy method and used to set a suitable linear programming model. If the solution of the latter yields any tour, the graph is Hamiltonian. Numerical results reveal that when the size of graph is small, say less than 50 nodes, there is a high chance the algorithm will be terminated in its cross entropy component by simply generating a Hamiltonian cycle, randomly. However, for larger graphs, in most of the tests the algorithm terminated in its optimization component (by solving the proposed linear program).