Log in

Relevant bibliographies by topics / Prime polynomials

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Prime polynomials'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Prime polynomials.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Prime polynomials"

1

Beardon, Alan F. "Prime matrices and prime polynomials." Mathematical Gazette 93, no. 528 (November 2009): 433–40. http://dx.doi.org/10.1017/s0025557200185171.

Full text

Abstract:

In an earlier paper in the Gazette the authors of define what it means for a matrix in a set M of n × n matrices to be prime, namely if it is not the product of two matrices in M, neither of which is the identity. They then showed that there are exactly two primes in the set M2 of 2 × 2 matrices with non-negative integral entries and unit determinant, namely,

APA, Harvard, Vancouver, ISO, and other styles

2

McLean, K. Robin. "Prime-Valued Polynomials." Mathematical Gazette 82, no. 494 (July 1998): 195. http://dx.doi.org/10.2307/3620402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Turnwald, Gerhard. "On Schur's conjecture." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 58, no. 3 (June 1995): 312–57. http://dx.doi.org/10.1017/s1446788700038349.

Full text

Abstract:

AbstractWe study polynomials over an integral domainRwhich, for infinitely many prime idealsP, induce a permutation ofR/P. In many cases, every polynomial with this property must be a composition of Dickson polynomials and of linear polynomials with coefficients in the quotient field ofR. In order to find out which of these compositions have the required property we investigate some number theoretic aspects of composition of polynomials. The paper includes a rather elementary proof of ‘Schur's Conjecture’ and contains a quantitative version for polynomials of prime degree.

APA, Harvard, Vancouver, ISO, and other styles

4

Kao, P. H. "Almost-prime polynomials at prime arguments." Journal of Number Theory 184 (March 2018): 85–106. http://dx.doi.org/10.1016/j.jnt.2017.08.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bonciocat, Anca Iuliana, Nicolae Ciprian Bonciocat, and Mihai Cipu. "Irreducibility Criteria for Compositions and Multiplicative Convolutions of Polynomials with Integer Coefficients." Analele Universitatii "Ovidius" Constanta - Seria Matematica 22, no. 1 (December 10, 2014): 73–84. http://dx.doi.org/10.2478/auom-2014-0007.

Full text

Abstract:

AbstractWe provide irreducibility criteria for multiplicative convolutions of polynomials with integer coefficients, that is, for polynomials of the form hdeg f · f(g/h), where f, g, h are polynomials with integer coefficients, and g and h are relatively prime. The irreducibility conditions are expressed in terms of the prime factorization of the leading coefficient of the polynomial hdeg f · f(g/h), the degrees of f, g, h, and the absolute values of their coefficients. In particular, by letting h = 1 we obtain irreducibility conditions for compositions of polynomials with integer coefficients.

APA, Harvard, Vancouver, ISO, and other styles

6

Salas, Christian. "Cantor Primes as Prime-Valued Cyclotomic Polynomials." International Journal of Open Problems in Computer Science and Mathematics 5, no. 3 (September 2012): 68–74. http://dx.doi.org/10.12816/0006120.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Hashemi, E. "Prime Ideals and Strongly Prime Ideals of Skew Laurent Polynomial Rings." International Journal of Mathematics and Mathematical Sciences 2008 (2008): 1–8. http://dx.doi.org/10.1155/2008/835605.

Full text

Abstract:

We first study connections betweenα-compatible ideals ofRand related ideals of the skew Laurent polynomials ringR[x,x−1;α], whereαis an automorphism ofR. Also we investigate the relationship ofP(R)andNr(R)ofRwith the prime radical and the upper nil radical of the skew Laurent polynomial rings. Then by using Jordan's ring, we extend above results to the case whereαis not surjective.

APA, Harvard, Vancouver, ISO, and other styles

8

Akbary, Amir, and Keilan Scholten. "Artin prime producing polynomials." Mathematics of Computation 84, no. 294 (December 2, 2014): 1861–82. http://dx.doi.org/10.1090/s0025-5718-2014-02902-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Grosswald, Emil. "On prime representing polynomials." Proceedings of the Indian Academy of Sciences - Section A 97, no. 1-3 (December 1987): 75–84. http://dx.doi.org/10.1007/bf02837816.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mikaelian, Vahagn. "On Degrees of Modular Common Divisors and the Big PrimegcdAlgorithm." International Journal of Mathematics and Mathematical Sciences 2016 (2016): 1–13. http://dx.doi.org/10.1155/2016/3262450.

Full text

Abstract:

We consider a few modifications of the Big prime modulargcdalgorithm for polynomials inZ[x]. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors of a resultant, and on finding preliminary bounds on degrees of common divisors using auxiliary primes. These modifications are used to suggest improved algorithms forgcdcalculation and for coprime polynomials detection. To illustrate the ideas we apply the constructed algorithms on certain polynomials, in particular on polynomials from Knuth’s example of intermediate expression swell.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Prime polynomials"

1

Hines, Peter Anthony. "The linear complexity of de Bruijn sequences over finite fields." Thesis, Royal Holloway, University of London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Anderson, Robert Lawrence. "An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd869.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wootton, Aaron. "Defining algebraic polynomials for cyclic prime covers of the Riemann sphere." Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/280574.

Full text

Abstract:

A compact Riemann surface X is said to be a cyclic p-gonal surface if it admits an automorphism φ of prime order p such that the quotient space X/(φ) has genus 0. It is said to be normal cyclic p-gonal if in addition, the group generated by φ is normal in the full automorphism group of X. In the following notes, we determine a method to find defining polynomial equations for any cyclic p-gonal surface X. If the surface X is assumed to be normal cyclic p-gonal, then all redundancies--equations which are equations for the same surface up to conformal equivalence--are also found.

APA, Harvard, Vancouver, ISO, and other styles

4

Suresh, Arvind. "On the Characterization of Prime Sets of Polynomials by Congruence Conditions." Scholarship @ Claremont, 2015. http://scholarship.claremont.edu/cmc_theses/993.

Full text

Abstract:

This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.

APA, Harvard, Vancouver, ISO, and other styles

5

Domingues, Riaal. "A polynomial time algorithm for prime recognition." Diss., Pretoria : [s.n.], 2006. http://upetd.up.ac.za/thesis/available/etd-08212007-100529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Moraes, de Oliveira Nathália. "Inductive valuations and defectless polynomials over henselian fields." Doctoral thesis, Universitat Autònoma de Barcelona, 2019. http://hdl.handle.net/10803/666758.

Full text

Abstract:

Sigui (K,v)un cos valorat discret de rang 1. En un treball pioner, S. MacLane va estudiar i caracteritzar les extensions de la valoració v al cos K(x) de les funcions racionals. M. Vaquié va generalitzar aquest treball al cas d’una valoració v arbitrària, no necessàriament de rang 1 ni discreta. En el cas discret i de rang 1, J. Fernández, J. Guàrdia, J. Montes i E. Nart, van fer una contribució constructiva a la teoria, calculant generadors de les àlgebres graduades d’aquestes valoracions, i introduint certs operadors de polinomis residuals. En aquesta memòria, estenem aquests resultats constructius al cas d’un cos valorat arbitrari, amb una valoració no necessàriament de rang 1 ni discreta. També establim una connexió entre valoracions inductives i polinomis irreductibles amb coeficients en una henselianització K^h de (K,v). Més precisament, construim una aplicació bijectiva M— Po/ =, entre l’espai de MacLane de(K,v) (identificat a un espai de “tipus forts”) i cert quocient del subconjunt Po C P format pels polinomis sense defecte amb coeficients en el cos K . Finalment, apliquem aquestes tècniques a reobtenir resultats sobre el càlcul d’invariants d’elements algebraics moderadament ramificats sobre cossos henselians.
Let (K; v) be a discrete rank-one valued eld. In a pioneering work, S. MacLane studied and characterized the extensions of the valuation v to the rational function eld K(x). M. Vaquié generalized his work for an arbitrary valued eld (K; v), not necessarily rank-one nor discrete. A more constructive contribution for the theory was given in the case where v is discrete of rank-one, where J. Fernández, J. Guàrdia, J. Montes and E. Nart provided a computation of generators of the graded algebras and introduced some residual polynomial operators. In this memoir we extend these results to a valued eld (K; v), not necessarily rank-one nor discrete. We also establish a connection between inductive valuations and irreducible polynomials with coecients in Kh, precisely, we construct a bijective mapping M — P0= between the MacLane space of (K; v) (considered as the set of strong types) and a certain quotient of the subset P0 C P of defectless polynomials with coecients in the henselian eld K. Finally, as an application of the techniques presented in this work we reobtain some results on the computation of invariants of tame algebraic elements over henselian fields

APA, Harvard, Vancouver, ISO, and other styles

7

Burns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.

Full text

Abstract:

Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory, and analytic probability and statistics. A common theme of recursively defined functions, weighted sums, and cross-referencing sequences arises in all three contexts, and supplemented by sieving methods, generating functions, asymptotics, and heuristic algorithms. In the area of number theory, this work generalizes the sieve of Eratosthenes to a sequence of polynomial values called polynomial-value sieving. In the case of quadratics, the method of polynomial-value sieving may be characterized briefly as a product presentation of two binary quadratic forms. Polynomials for which the polynomial-value sieving yields all possible integer factorizations of the polynomial values are called recursively-factorable. The Euler and Legendre prime producing polynomials of the form n2+n+p and 2n2+p, respectively, and Landau's n2+1 are shown to be recursively-factorable. Integer factorizations realized by the polynomial-value sieving method, applied to quadratic functions, are in direct correspondence with the lattice point solutions (X,Y) of the conic sections aX2+bXY +cY2+X-nY=0. The factorization structure of the underlying quadratic polynomial is shown to have geometric properties in the space of the associated lattice point solutions of these conic sections. In the area of combinatorial graph theory, this work considers two topological structures that are used to model the process of homologous genetic recombination: assembly graphs and chord diagrams. The result of a homologous recombination can be recorded as a sequence of signed permutations called a micronuclear arrangement. In the assembly graph model, each micronuclear arrangement corresponds to a directed Hamiltonian polygonal path within a directed assembly graph. Starting from a given assembly graph, we construct all the associated micronuclear arrangements. Another way of modeling genetic rearrangement is to represent precursor and product genes as a sequence of blocks which form arcs of a circle. Associating matching blocks in the precursor and product gene with chords produces a chord diagram. The braid index of a chord diagram can be used to measure the scope of interaction between the crossings of the chords. We augment the brute force algorithm for computing the braid index to utilize a divide and conquer strategy. Both assembly graphs and chord diagrams are closely associated with double occurrence words, so we classify and enumerate the double occurrence words based on several notions of irreducibility. In the area of analytic probability, moments abstractly describe the shape of a probability distribution. Over the years, numerous varieties of moments such as central moments, factorial moments, and cumulants have been developed to assist in statistical analysis. We use inversion formulas to compute high order moments of various types for common probability distributions, and show how the successive ratios of moments can be used for distribution and parameter fitting. We consider examples for both simulated binomial data and the probability distribution affiliated with the braid index counting sequence. Finally we consider a sequence of multiparameter binomial sums which shares similar properties with the moment sequences generated by the binomial and beta-binomial distributions. This sequence of sums behaves asymptotically like the high order moments of the beta distribution, and has completely monotonic properties.

APA, Harvard, Vancouver, ISO, and other styles

8

FREITAS, Sabrina Alves de. "Polinômios centrais para álgebras T-primas." Universidade Federal de Campina Grande, 2010. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/1233.

Full text

Abstract:

Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-07-24T16:42:24Z No. of bitstreams: 1 SABRINA ALVES DE FREITAS - DISSERTAÇÃO PPGMAT 2010..pdf: 457483 bytes, checksum: d828740083c1ccca9a0a0f8b45be01d0 (MD5)
Made available in DSpace on 2018-07-24T16:42:24Z (GMT). No. of bitstreams: 1 SABRINA ALVES DE FREITAS - DISSERTAÇÃO PPGMAT 2010..pdf: 457483 bytes, checksum: d828740083c1ccca9a0a0f8b45be01d0 (MD5) Previous issue date: 2010-04
Capes
Neste trabalho apresentaremos um estudo sobre polinômios centrais ordinários, Z2-graduados e com involução para algumas importantes álgebras na PI-teoria sobre corpos infinitos. Mais precisamente, descreveremos os polinômios centrais Z2-graduados para as álgebras M2(K) (matrizes 2 × 2 sobre um corpo K), M1,1(E) (subálgebra de M2(E) que consite das matrizes cujas entradas da diagonal principal estão em E0 e os da diagonal secundária estão em E1,onde E é a álgebra de Grassmann com unidade de dimensão infinita e E0 e E1 suas componentes homogêneas de graus 0 e 1, respectivamente) e E ⊗ E. Além disso descreveremos os polinômios centrais para E sobre um corpo infinito K de característica diferente de 2 e finalmente os polinômios centrais com involução para M2(K), considerando as involuções transposta e simplética.
In this work we study ordinary, Z2-graded central polinomials and central polinomials with involution for some important algebras in the theory of algebras with polinomial identities, over infinite fields.Namely, we decribe Z2-graded central polinomials for the algebras M2(K) (2 × 2 matrices over a field K), M1,1(E) (subalgebra of M2(E) whose entries on the diagonal belong to E0 and the off-diagonal entries lie in E1, E is the infinite-dimensional unitary Grassmann algebra, E0 is the center of E and E1 is the anticommutative part of E) and E ⊗ E. Also, we describe the central polinomials for e over a field K, with charK ≠ 2 and finally the central polinomial with involution for M2 (K), considering the transpose and the sympletic involutions.

APA, Harvard, Vancouver, ISO, and other styles

9

Bamunoba, Alex Samuel. "Arithmetic of carlitz polynomials." Doctoral thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/95850.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gopalan, Parikshit. "Computing with Polynomials over Composites." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11564.

Full text

Abstract:

In the last twenty years, algebraic techniques have been applied with great success to several areas in theoretical computer science. However, for many problems involving modular counting, there is a huge gap in our understanding depending on whether the modulus is prime or composite. A prime example is the problem of showing lower bounds for circuits with Mod gates in circuit complexity. Proof techniques that work well for primes break down over composites. Moreover, in some cases, the problem for composites turns out to be very different from the prime case. Making progress on these problems seems to require a better understanding of polynomials over composites. In this thesis, we address some such "prime vs. composite" problems from algorithms, complexity and combinatorics, and the surprising connections between them. We consider the complexity-theoretic problem of computing Boolean functions using polynomials modulo composites. We show that symmetric polynomials can viewed as simultaneous communication protocols. This equivalence allows us to use techniques from communication complexity and number theory to prove degree bounds. We use these to give the first tight degree bounds for a number of Boolean functions. We consider the combinatorial problem of explicit construction of Ramsey graphs. We present a simple construction of such graphs using polynomials modulo composites. This approach gives a unifying view of many known constructions,and explains why they all achieve the same bound.We show that certain approaches to this problem cannot give better bounds. Finally, we consider the algorithmic problem of interpolation for polynomials modulo composites. We present the first query-efficient algorithms for interpolation and learning under a distribution. These results rely on some new structural results about such polynomials.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Prime polynomials"

1

Goodearl, K. R. Prime ideals in skew and q-skew polynomial rings. Providence, R.I: American Mathematical Society, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

McWilliams, Alicia M. The appliucation of orthogonal polynomials to analyse the price movements of precious metals. (s.l: The Author), 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Computational aspects of modular forms and Galois representations: How one can compute in polynomial time the value of Ramanujan's tau at a prime. Princeton: Princeton University Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kubbinga, Henk, ed. The Collected Papers of Frits Zernike (1888-1966): Volumes I, II, III, IV. Groningen, Netherlands: Groningen University Press, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Florian, Luca, ed. Analytic number theory: Exploring the anatomy of integers. Providence, R.I: American Mathematical Society, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science). Springer, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Cai, Zongwu. Functional Coefficient Models for Economic and Financial Data. Edited by Frédéric Ferraty and Yves Romain. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780199568444.013.6.

Full text

Abstract:

This article discusses the use of functional coefficient models for economic and financial data analysis. It first provides an overview of recent developments in the nonparametric estimation and testing of functional coefficient models, with particular emphasis on the kernel local polynomial smoothing method, before considering misspecification testing as an important econometric question when fitting a functional (varying) coefficient model or a trending time-varying coefficient model. It then describes two major real-life applications of functional coefficient models in economics and finance: the first deals with the use of functional coefficient instrumental-variable models to investigate the empirical relation between wages and education in a random sample of young Australian female workers from the 1985 wave of the Australian Longitudinal Survey, and the second is concerned with the use of functional coefficient beta models to analyze the common stock price of Microsoft stock (MSFT) during the year 2000 using the daily closing prices.

APA, Harvard, Vancouver, ISO, and other styles

8

Jong, Robin de, Franz Merkl, Jean-Marc Couveignes, Johan Bosman, and Bas Edixhoven. Computational Aspects of Modular Forms and Galois Representations: How One Can Compute in Polynomial Time the Value of Ramanujan's Tau at a Prime. Princeton University Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Couveignes, Jean-Marc, and Bas Edixhoven. Computational Aspects of Modular Forms and Galois Representations: How One Can Compute in Polynomial Time the Value of Ramanujan's Tau at a Prime. Princeton University Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Prime polynomials"

1

Lucas, Thomas G. "Divisorial Prime Ideals in Prüfer Domains." In Rings, Polynomials, and Modules, 281–98. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-65874-2_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Orłowski, Arkadiusz, and Leszek J. Chmielewski. "Ulam Spiral and Prime-Rich Polynomials." In Computer Vision and Graphics, 522–33. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00692-1_45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kovačec, Alexander. "Relatively Prime Gröbner Bases and Reducibility of S-Polynomials." In Lattices, Semigroups, and Universal Algebra, 143–46. Boston, MA: Springer US, 1990. http://dx.doi.org/10.1007/978-1-4899-2608-1_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bogdanov, Andrej, Akinori Kawachi, and Hidetoki Tanaka. "Hard Functions for Low-Degree Polynomials over Prime Fields." In Mathematical Foundations of Computer Science 2011, 120–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22993-0_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Filippis, Vincenzo De, Giovanni Scudo, and Feng Wei. "b-Generalized Skew Derivations on Multilinear Polynomials in Prime Rings." In Springer INdAM Series, 109–38. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63111-6_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Dhara, Basudeb. "Generalized Derivations with Nilpotent Values on Multilinear Polynomials in Prime Rings." In Algebra and its Applications, 307–19. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-1651-6_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Elliott, P. D. T. A. "More Primes and Polynomials." In Developments in Mathematics, 299–320. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4757-6044-6_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lyall, Neil, and Alex Rice. "Polynomial Differences in the Primes." In Combinatorial and Additive Number Theory, 129–46. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-1601-6_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Baier, Stephan, and Liangyi Zhao. "On primes represented by quadratic polynomials." In CRM Proceedings and Lecture Notes, 159–66. Providence, Rhode Island: American Mathematical Society, 2008. http://dx.doi.org/10.1090/crmp/046/11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Konyagin, Sergei, and Carl Pomerance. "On Primes Recognizable in Deterministic Polynomial Time." In Algorithms and Combinatorics, 176–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60408-9_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Prime polynomials"

1

Bialostocki, A., and T. Shaska. "Galois groups of prime degree polynomials with nonreal roots." In Computational Aspects of Algebraic Curves. WORLD SCIENTIFIC, 2005. http://dx.doi.org/10.1142/9789812701640_0015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Haramaty, Elad, Amir Shpilka, and Madhu Sudan. "Optimal Testing of Multivariate Polynomials over Small Prime Fields." In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2011. http://dx.doi.org/10.1109/focs.2011.61.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Levin, Alexander. "Bivariate Dimension Polynomials of Non-Reflexive Prime Difference-Differential Ideals." In ISSAC '18: International Symposium on Symbolic and Algebraic Computation. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3208976.3209008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lima, J. B., R. M. Campello de Souza, and D. Panario. "Security of public-key cryptosystems based on Chebyshev polynomials over prime finite fields." In 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4595307.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kitano, Teruaki, and Masaaki Suzuki. "Twisted Alexander polynomials and a partial order on the set of prime knots." In Groups, homotopy and configuration spaces, in honour of Fred Cohen's 60th birthday. Mathematical Sciences Publishers, 2008. http://dx.doi.org/10.2140/gtm.2008.13.307.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bob-Manuel, K. D. H., and B. O. Okim. "Optimising technique in matching combined diesel engine or gas turbine (CODOG) propulsion system to hull and propeller of a frigate." In 14th International Naval Engineering Conference and Exhibition. IMarEST, 2018. http://dx.doi.org/10.24868/issn.2515-818x.2018.035.

Full text

Abstract:

In operation of a combined diesel engine or gas turb ine (CODOG) propulsion system, optimal matching of prime movers with propellers and ship hull is of great importance. Selection of an ideal propeller pitch that will be apt for different operating conditions of a marine vessel is an arduous task and requires initial assessment with a dedicated mathematical model. In this work, matching CODOG propulsion system to achieve best operation of type F90 frigate was carried out. A non-complex Java computer program (prop-matching) was developed to facilitate the matching process using dedicated simulation models in design and off-design conditions. The goal is to understand the interaction of either diesel engine or gas turbine with propeller and ship hull. The pitch of a controllable pitch propeller (CPP) was varied to the limit of optimal operation to absorb the power in either diesel engine or gas turbine mode in wide range of engine speeds and load. If a pitch other than that for the appropriate load and speed is selected, there would be an increase in fuel consumption, cavitation, vibration induced stresses in addition to stresses caused by engine load and wave motion on the vessel. The determination of the optimal operating points will lead to significant improvement in flexibility, minimum environmental impact and operating cost. Propeller characteristics were determined with hydrodynamics based on updated B-series regression polynomials which were correlated using Boundary Element Methods (BEM) and tuned with semi-empirical corrections. The analysis showed that the pitch ratio of a propeller has a dominating influence in the selection of the optimal points under operations in diesel or gas turbine mode and that the highest propeller efficiency did not occur at the optimal points. The output results for the open water propeller characteristics from this model are in good agreement with results of other authors and commercial Lindo software.

APA, Harvard, Vancouver, ISO, and other styles

7

YOKOYAMA, KAZUHIRO. "PRIME DECOMPOSITION OF POLYNOMIAL IDEALS OVER FINITE FIELDS." In Proceedings of the First International Congress of Mathematical Software. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812777171_0022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Adleman, L., and M. Huang. "Recognizing primes in random polynomial time." In the nineteenth annual ACM conference. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/28395.28445.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lu, Peng, and James N. Siddall. "Nonlinear Programming Using Logic Methods." In ASME 1991 Design Technical Conferences. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/detc1991-0066.

Full text

Abstract:

Abstract The algorithm presented here combines Boolean logic analysis with heuristic search to solve the general 0-1 polynomial programming problem. It can also be extended to solve continuous variable problems, after the problem has been converted to discrete polynomial form. Logic relations embedded in 0-1 variables are explored by a simple consensus operation to serve as the main minimization strategy. The procedure for sequential generation of prime implicants avoids rapidly increasing the number of prime implicants when problems become large. The computational results indicate that this algorithm is quite reliable for 0-1 problem formulations.

APA, Harvard, Vancouver, ISO, and other styles

10

Law, Marshall, and Michael Monagan. "A parallel implementation for polynomial multiplication modulo a prime." In PASCO '15: International Workshop on Parallel Symbolic Computation. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2790282.2790291.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!