✦ LIBER ✦

On the Additive Completion of Polynomial Sets

✍ Scribed by L. Habsieger

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 142 KB
Volume: 51
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1995.1039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Additive Completion of kth Powers

✍ Wenguang Zhai 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Let k 2 be a fixed integer. For positive integers M N, let S k (M, N) denote the set of all sets A/[0, M] such that, for all positive integers n N, n can be written as n=a+b k with a # A and b a positive integer. Define Given =>0, we prove that there exists a $>0 such that for all sufficiently larg

The Additive Completion of Kth-Powers

✍ J. Cilleruelo 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Polynomial-Time Isomorphism of 1-L-Compl

Polynomial-Time Isomorphism of 1-L-Complete Sets

✍ Manindra Agrawal; Somenath Biswas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Let C be any complexity class closed under log-lin reductions. We show that all sets complete for C under 1-L reductions are polynomialtime isomorphic to each other. We also generalize the result to reductions computed by finite-crossing machines. As a corollary, we show that all sets complete for C

On Definitions of Cuts and Completion of

On Definitions of Cuts and Completion of Partially Ordered Sets

✍ Alexander Abian 📂 Article 📅 1968 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

On the Number of Sets Definable by Polyn

On the Number of Sets Definable by Polynomials

✍ Gabriela Jeronimo; Juan Sabia 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 102 KB

We show that the known algorithms used to re-write any first order quantifierfree formula over an algebraically closed field into its normal disjunctive form are essentially optimal. This result follows from an estimate of the number of sets definable by equalities and inequalities of fixed polynomi

Almost all trees share a complete set of

Almost all trees share a complete set of immanantal polynomials

✍ Phillip Botti; Russell Merris 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 371 KB

## Abstract Let χ be an irreducible character of the symmetric group __S__~__n__~. For an __n__‐by‐__n__ matrix __A__ = (__a__~__ij__~), define equation image If __G__ is a graph, let __D__(__G__) be the diagonal matrix of its vertex degrees and __A__(__G__) its adjacency matrix. Let __y__ and __