923 search results - page 69 / 185 » On a generalization of Stickelberger's Theorem |
138
click to vote
IJAC
2006
15 years 6 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
157
click to vote
MST
2006
15 years 6 months ago
2006
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
197
click to vote
JAIR
2007
15 years 6 months ago
2007
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
161
click to vote
JAR
2007
15 years 6 months ago
2007
The vision of a computerised assistant to mathematicians has existed since the inception of theorem proving systems. The Alcor system has been designed to investigate and explore h...
176
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...