Sciweavers

JSC
2006
52views more  JSC 2006»
13 years 4 months ago
Markov bases of three-way tables are arbitrarily complicated
We show the following two universality statements on the entry-ranges and Markov bases of spaces of 3-way contingency tables with fixed 2-margins: (1) For any finite set D of nonn...
Jesús A. De Loera, Shmuel Onn
JSC
2006
81views more  JSC 2006»
13 years 4 months ago
A database of local fields
We describe our online database of finite extensions of Qp, and how it can be used to facilitate local analysis of number fields.
John W. Jones, David P. Roberts
JSC
2006
56views more  JSC 2006»
13 years 4 months ago
Viterbi sequences and polytopes
A Viterbi path of length n of a discrete Markov chain is a sequence of n + 1 states that has the greatest probability of ocurring in the Markov chain. We divide the space of all M...
Eric H. Kuo
JSC
2006
56views more  JSC 2006»
13 years 4 months ago
The lex game and some applications
Bálint Felszeghy, Balázs Ráth...
JSC
2006
95views more  JSC 2006»
13 years 4 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
JSC
2006
106views more  JSC 2006»
13 years 4 months ago
Markov bases for noncommutative Fourier analysis of ranked data
To calibrate Fourier analysis of S5 ranking data by Markov chain Monte Carlo techniques, a set of moves (Markov basis) is needed. We calculate this basis, and use it to provide a ...
Persi Diaconis, Nicholas Eriksson
JSC
2006
72views more  JSC 2006»
13 years 4 months ago
Algebraic solutions of holomorphic foliations: An algorithmic approach
We present two algorithms that can be used to check whether a given holomorphic foliation of the projective plane has an algebraic solution, and discuss the performance of their im...
S. C. Coutinho, L. Menasché Schechter
JSC
2006
132views more  JSC 2006»
13 years 4 months ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
JSC
2006
102views more  JSC 2006»
13 years 4 months ago
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
Max-Louis G. Buot, Donald St. P. Richards
JSC
2006
71views more  JSC 2006»
13 years 4 months ago
Brauer groups of diagonal quartic surfaces
We describe explicit methods of exhibiting elements of the Brauer groups of diagonal quartic surfaces. Using these methods, we compute the algebraic Brauer
Martin Bright