On the number of partitions with distinct even parts

Let ped(n) be the number of partitions of n wherein even parts are distinct (and odd parts are unrestricted). We obtain many congruences for ped(n)mod2 and mod4 by the theory of Hecke eigenforms.     

On a problem of partitions of the set of nonnegative integers with the same representation functions

Dombi has shown that the set $\mathbb{N}$ of all non-negative integers can be partitioned into two subsets with identical representation functions. In this paper, we prove that one cannot partition $\mathbb{N}$ into more than two subsets with identical representation functions, while for any integer $k\ge 3$ there is a partition $\mathbb{N}=A_1\cup ?\cup A_k$ such that $A_i$ and $A_{k+1?i}$ have the same representation function for any integer $1\le i\le k$.     

On polynomial selection for the general number field sieve

The general number field sieve (GNFS) is the asymptotically fastest algorithm for factoring large integers. Its runtime depends on a good choice of a polynomial pair. In this article we present an improvement of the polynomial selection method of Montgomery and Murphy which has been used in recent GNFS records.

     

Characterizing the number of coloured m-ary partitions modulo m,with and without gaps

In a pair of recent papers, Andrews, Fraenkel and Sellers provide a complete characterization for the number of $m$-ary partitions modulo $m$, with and without gaps. In this paper we extend these results to the case of coloured $m$-ary partitions, with and without gaps. Our method of proof is different, giving explicit expansions for the generating functions modulo $m$.     

On the number of distinct roots of a lacunary polynomial over finite fields

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.     

On the spectral radii of unicyclic graphs with fixed matching number

In this paper, the first five sharp upper bounds on the spectral radii of unicyclic graphs with fixed matching number are presented. The first ten spectral radii over the class of unicyclic graphs on a given number of vertices and the first four spectral radii of unicyclic graphs with perfect matchings are also given, respectively.     

On the divided differences of the remainder in polynomial interpolation

We present formulas for the divided differences of the remainder of the interpolation polynomial that include some recent interesting formulas as special cases.     

A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables

We show that the production-transportation problem involving an arbitrary fixed number of factories with concave production cost is solvable in strongly polynomial time. The algorithm is based on a parametric approach which takes full advantage of the specific structure of the problem: monotonicity of the objective function along certain directions, small proportion of nonlinear variables and combinatorial properties implied by transportation constraints.     

On the integral representation formula for a two‐component elastic composite

The aim of this paper is to derive, in the Hilbert space setting, an integral representation formula for the effective elasticity tensor for a two‐component composite of elastic materials, not necessarily well‐ordered. This integral representation formula implies a relation which links the effective elastic moduli to the N‐point correlation functions of the microstructure. Such relation not only facilitates a powerful scheme for systematic incorporation of microstructural information into bounds on the effective elastic moduli but also provides a theoretical foundation for inverse‐homogenization. The analysis presented in this paper can be generalized to an n‐component composite of elastic materials. The relations developed here can be applied to the inverse‐homogenization for a special class of linear viscoelastic composites. The results will be presented in another paper. Copyright © 2005 John Wiley & Sons, Ltd.     

On trees with real-rooted independence polynomial

The independence polynomial of a graph $G$ is

$I(G,x)=\sum _{k\ge 0}{i}_k\left(G\right)x^k,$

where $i_k\left(G\right)$ denotes the number of independent sets of $G$ of size $k$ (note that $i_0\left(G\right)=1$). In this paper we show a new method to prove real-rootedness of the independence polynomials of certain families of trees.In particular we will give a new proof of the real-rootedness of the independence polynomials of centipedes (Zhu’s theorem), caterpillars (Wang and Zhu’s theorem), and we will prove a conjecture of Galvin and Hilyard about the real-rootedness of the independence polynomial of the so-called Fibonacci trees.     

Binary terms in polynomial representations of Boolean functions

Polynomial representations of Boolean functions by binary terms are considered. The construction of terms involves variables and residual functions. Special cases of such representations are the decomposition of a function with respect to variables, Zhegalkin polynomials, and representations of functions as sums of conjunctions of residual functions.     

On the number of partitions into primes

There is, apparently, a persistent belief that in the current state of knowledge it is not possible to obtain an asymptotic formula for the number of partitions of a number n into primes when n is large. In this paper such a formula is obtained. Since the distribution of primes can only be described accurately by the use of the logarithmic integral and a sum over zeros of the Riemann zeta-function one cannot expect the main term to involve only elementary functions. However the formula obtained, when n is replaced by a real variable, is in and is readily seen to be monotonic. Research supported by NSA grant, no. MDA904-03-1-0082.     

Self-conjugate partitions with the same disparity

We give a bijection between the set of ordinary partitions and that of self-conjugate partitions with some restrictions. Also, we show the relationship between hook lengths of a self-conjugate partition and its corresponding partition via the bijection. As a corollary, we give new combinatorial interpretations for the Catalan number and the Motzkin number in terms of self-conjugate simultaneous core partitions.     

On weighted polynomial approximation with monotone weights

We construct an even weight monotone on the right half line such that the logarithmic integral of the largest -convex minorant of converges and the polynomials are dense in .     

On the coefficients of a polynomial with restricted zeros

LetP(Z)=αn Zn + αn-1Zn-1 +…+α0 be a complex polynomial of degree n. There is a close connection between the coefficients and the zeros of P(z). In this paper we prove some sharp inequalities concerning the coeffi-cients of the polynomial P(z) with restricted zeros. We also establish a sufficient condition for the separation of zeros of P(z).     

On one representation of analytic functions by harmonic functions

Let u(x) be a function analytic in some neighborhood D about the origin, $ \mathcal{D} Let u(x) be a function analytic in some neighborhood D about the origin, ⊂ ℝ ⁿ . We study the representation of this function in the form of a series u(x) = u ₀(x) + |x|² u ₁(x) + |x|⁴ u ₂(x) + …, where u _k (x) are functions harmonic in . This representation is a generalization of the well-known Almansi formula. Original Russian Text ? V. V. Karachik, 2007, published in Matematicheskie Trudy, 2007, Vol. 10, No. 2, pp. 142–162.