Results 11 to 20 of about 6,070 (257)
Effective Hilbert irreducibility [PDF]
Information and Control, 1985 The author extends joint work with \textit{J. von zur Gathen} [Math. Comput. 45, 251-261 (1985)] to an explicit probabilistic criterion for the irreducibility of \(f(x_ 1,x_ 2,...,x_ v)\in F[x_ 1,x_ 2,...,x_ v]\) for F a field (\({\mathbb{Q}}\) or finite). Here if char F\(=p\), then each coefficient of f is assumed to have a p-th root. Let \(S\subseteq
Kaltofen, Erich
openaire +2 more sources
Setting the demons loose: computational irreducibility does not guarantee unpredictability or emergence [PDF]
, 2021 A phenomenon resulting from a computationally irreducible (or computationally incompressible) process is supposedly unpredictable except via simulation. This notion of unpredictability has been deployed to formulate some recent accounts of computational ...
Tabatabaei Ghomi, Hamed
core +1 more source
International Electronic Journal of Algebra, 2023 In this paper, we prove that the family of binomials $x_1^{a_1} \cdots x_m^{a_m}-y_1^{b_1}\cdots y_n^{b_n}$ with $\gcd(a_1, \ldots, a_m, b_1, \ldots, b_n)=1$ is irreducible by identifying the connection between the irreducibility of a binomial in ${\mathbb C}[x_1, \ldots, x_m, y_1, \ldots, y_n]$ and ${\mathbb C}(x_2, \ldots, x_m, y_1, \ldots, y_n)[x_1]$
WANG, Haohao +2 more
openaire +3 more sources
Irreducibility of Hypersurfaces [PDF]
Communications in Algebra, 2009 Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most deg(P)^2-1 values of the coefficient.
Bodin, Arnaud +2 more
openaire +2 more sources
Graded-irreducible modules are irreducible [PDF]
Communications in Algebra, 2016 Comments are welcome, to appear in Communications in ...
Chen, Justin, Kim, Youngsu
openaire +2 more sources
Mixture Proportion Estimation Beyond Irreducibility [PDF]
, 2023 The task of mixture proportion estimation (MPE) is to estimate the weight of a component distribution in a mixture, given observations from both the component and mixture.
Holland, Darren +5 more
core +1 more source
Irreducible Subcube Partitions
The Electronic Journal of Combinatorics, 2023 A subcube partition is a partition of the Boolean cube $\{0,1\}^n$ into subcubes. A subcube partition is irreducible if the only sub-partitions whose union is a subcube are singletons and the entire partition. A subcube partition is tight if it “mentions” all coordinates.
Yuval Filmus +6 more
openaire +2 more sources
On Hilbert's Irreducibility Theorem [PDF]
, 1974 A method for obtaining very precise results along the lines of the Hilbert Irreducibility Theorem is described and then applied to a special case. In addition, the relationship of the irreducibility theorem to other tools of diophantine analysis is ...
Fried, Michael
core +1 more source
A heuristic irreducibility test for univariate polynomials [PDF]
, 1992 This paper describes a heuristic irreducibility test for univariate polynomials over the integers. The irreducibility test is based on finding a prime evaluation of a polynomial which, under appropriate conditions, is a witness to the irreducibility of ...
Monagan, Michael B.
core +1 more source
EISENSTEIN IRREDUCIBILITY CRITERION FOR MODULES
, 2021 In this article, we study factorial modules. Let M be a torsion free module over an integral domain R. We prove Gauss Lemma for modules and also we give Eisenstein irreducibility criterion for factorial modules.
core +1 more source