Sciweavers

18 search results - page 3 / 4
» Computing Rational Forms of Integer Matrices
Sort
View
CADE
2012
Springer
11 years 10 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
COMBINATORICS
2000
90views more  COMBINATORICS 2000»
13 years 7 months ago
Determinantal Expression and Recursion for Jack Polynomials
We describe matrices whose determinants are the Jack polynomials expanded in terms of the monomial basis. The top row of such a matrix is a list of monomial functions, the entries...
Luc Lapointe, Alain Lascoux, Jennifer Morse
MOC
1998
147views more  MOC 1998»
13 years 7 months ago
On the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
Michael A. Bennett, Benjamin M. M. de Weger
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
13 years 11 months ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas
LICS
1998
IEEE
13 years 11 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka