Related papers: On Stanley's theorem and its Generalizations

The aim of this note is to give a proof of the Schottky theorem in general domains in $\mathbb{C}^n$. The proof is short and works for the cases $n = 1$ and $n > 1$ at the same time.

We compute the Stanley depth for a particular, but important case, of the quotient of complete intersection monomial ideals. Also, in the general case, we give sharp bounds for the Stanley depth of a quotient of complete intersection…

Sturm oscillation theorem for second order differential equations was generalized to systems and higher order equations with positive leading coefficient by several authors. What we propose here is a Sturm oscillation theorem for systems of…

We introduce the concept of Stanley decompositions in the localized polynomial ring $S_f$ where $f$ is a product of variables, and we show that the Stanley depth does not decrease upon localization. Furthermore it is shown that for monomial…

In this paper, we study the partition theory over totally real number fields. Let $K$ be a totally real number field. A partition of a totally positive algebraic integer $\delta$ over $K$ is $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_r)$…

In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved

In this article, we provide partition-theoretic interpretations for some new truncated pentagonal number theorem and identities of Gauss. Also, we deduce few inequalities for some partition functions.

Stanley generalized MacMahon's classical theorem by proving a product formula for the norm-trace generating function for plane partition with unbounded parts. In his recent work on biothorgonal polynomials, Kamioka proved a finite analogue…

The Schmidt number is of crucial importance in characterizing the bipartite pure states. We explore and propose here a generalization of Schmidt number for states in multipartite systems. It is shown to be entanglement monotonic and valid…

We formulate generalizations of Pauli's theorem on the cases of real and complex Clifford algebras of even and odd dimensions. We give analogues of these theorems in matrix formalism. Using these theorems we present an algorithm for…

Peng, S. (\cite{P08b}) proved the law of large numbers under a sublinear expectation. In this paper, we give its error estimates by Stein's method.

We introduce a generalization of entanglement based on the idea that entanglement is relative to a distinguished subspace of observables rather than a distinguished subsystem decomposition. A pure quantum state is entangled relative to such…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. In this paper, it is shown that Stanley's conjecture holds for $S/I$, if $I$ is a weakly polymatroidal ideal.

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

In this paper we prove two general results related to Marstrand's projection theorem in a quite general formulation over separable metric spaces under a suitable transversality hypothesis (the "projections" are in principle only measurable)…

In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In…

In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…

In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.

Recently, George Andrews has given a Glaisher style proof of a finite version of Euler's partition identity. We generalise this result by giving a finite version of Glaisher's partition identity. Both the generating function and bijective…

The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…