Let S be a polynomial algebra over a field. We study classes of monomial ideals (as for example lexsegment ideals) of S having minimal depth. In particular, Stanley’s conjecture holds for these ideals. Also we show that if I is a monomial ideal with Ass(S/I) = {P1, P2, . . . , Ps} and Pi 6⊂ ∑s 1=j 6=i Pj for all i ∈ [s], then Stanley’s conjecture holds for S/

Bachman and Janiak provided a sketch of the proof that the problem 1|ri,pi(v)1⁄4 ai/v|Cmax is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete proof. Journal of the Operational Research Society (2012) 63, 1018–1020. doi:10.1057/jors...

The procedure used to determine the pionnucleon coupling constant g(2) from multi-energy fits to nucleon-nucleon (N-N) scattering data has been shortened without a material loss of accuracy. The g(2) presetting effect is discussed in connection with the limited accuracy of g(2) determinations in general and the possibilities of the "optimized polynomial expansions". The desirability of the Yale...

The Minimum Linear Arrangement problem (MLA) consists of finding a mapping $\pi$ from vertices graph to distinct integers that minimizes $\sum_{\{u,v\}\in E}|\pi(u) - \pi(v)|$. In setting, are often assumed lie on horizontal line and edges drawn as semicircles above said line. For trees, various algorithms available solve the in polynomial time $n=|V|$. There exist variants MLA which arrangemen...

‎this paper obtains the exact solutions of the wave equation as a second-order partial differential equation (pde)‎. ‎we are going to calculate polynomial and non-polynomial exact solutions by using lie point symmetry‎. ‎we demonstrate the generation of such polynomial through the medium of the group theoretical properties of the equation‎. ‎a generalized procedure for polynomial solution is pr...

in this paper, we show how certain metabelian groups can be found within polynomial evaluation groupoids. we show that every finite abelian group can beobtained as a polynomial evaluation groupoid.

We present a uniied framework for the study of the complexity of counting functions and multivariate polynomials such as the permanent and the hamiltonian in the computational model of Blum, Shub and Smale. For PI R we introduce complexity classes GenPI R and CGenPI R: The class GenPI R consists of the generating functions for graph properties (decidable in polynomial time) rst studied in the c...

It is proved that the associative differential graded algebra of (polynomial) polyvector fields on a vector space (may be infinite-dimensional) is quasi-isomorphic to the corresponding cohomological Hochschild complex of (polynomial) functions on this vector space as an associative differential graded algebra. This result is an A∞-version of the Formality conjecture of Maxim Kontsevich [K]. 1. ...