Auswahl der wissenschaftlichen Literatur zum Thema „Base du Gröbner“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Base du Gröbner" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Base du Gröbner"
Bokut, L. A., Yuqun Chen und Zerui Zhang. „Gröbner–Shirshov bases method for Gelfand–Dorfman–Novikov algebras“. Journal of Algebra and Its Applications 16, Nr. 01 (Januar 2017): 1750001. http://dx.doi.org/10.1142/s0219498817500013.
Der volle Inhalt der QuelleSteiner, Matthias Johann. „Solving Degree Bounds for Iterated Polynomial Systems“. IACR Transactions on Symmetric Cryptology 2024, Nr. 1 (01.03.2024): 357–411. http://dx.doi.org/10.46586/tosc.v2024.i1.357-411.
Der volle Inhalt der QuelleJha, Ranjan, Damien Chablat und Luc Baron. „Influence of design parameters on the singularities and workspace of a 3-RPS parallel robot“. Transactions of the Canadian Society for Mechanical Engineering 42, Nr. 1 (01.03.2018): 30–37. http://dx.doi.org/10.1139/tcsme-2017-0011.
Der volle Inhalt der QuelleYoshida, Hiroshi. „A model for analyzing phenomena in multicellular organisms with multivariable polynomials: Polynomial life“. International Journal of Biomathematics 11, Nr. 01 (Januar 2018): 1850007. http://dx.doi.org/10.1142/s1793524518500079.
Der volle Inhalt der QuelleGräbe, Hans-Gert, und Franz Pauer. „A remark on Hodge algebras and Gröbner bases“. Czechoslovak Mathematical Journal 42, Nr. 2 (1992): 331–38. http://dx.doi.org/10.21136/cmj.1992.128327.
Der volle Inhalt der QuelleBellini, Emanuele, Massimiliano Sala und Ilaria Simonetti. „Nonlinearity of Boolean Functions: An Algorithmic Approach Based on Multivariate Polynomials“. Symmetry 14, Nr. 2 (22.01.2022): 213. http://dx.doi.org/10.3390/sym14020213.
Der volle Inhalt der QuelleEder, Christian. „Improving incremental signature-based Gröbner basis algorithms“. ACM Communications in Computer Algebra 47, Nr. 1/2 (15.07.2013): 1–13. http://dx.doi.org/10.1145/2503697.2503699.
Der volle Inhalt der QuelleEder, Christian, und Jean-Charles Faugère. „A survey on signature-based Gröbner basis computations“. ACM Communications in Computer Algebra 49, Nr. 2 (14.08.2015): 61. http://dx.doi.org/10.1145/2815111.2815156.
Der volle Inhalt der QuelleFrancis, Maria, und Thibaut Verron. „A Signature-Based Algorithm for Computing Gröbner Bases over Principal Ideal Domains“. Mathematics in Computer Science 14, Nr. 2 (17.12.2019): 515–30. http://dx.doi.org/10.1007/s11786-019-00432-5.
Der volle Inhalt der QuelleEder, Christian. „An analysis of inhomogeneous signature-based Gröbner basis computations“. Journal of Symbolic Computation 59 (Dezember 2013): 21–35. http://dx.doi.org/10.1016/j.jsc.2013.08.001.
Der volle Inhalt der QuelleDissertationen zum Thema "Base du Gröbner"
Amendola, Teresa. „Basi di Gröbner e anelli polinomiali“. Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/19458/.
Der volle Inhalt der QuelleVilanova, Fábio Fontes. „Sistemas de equações polinomiais e base de Gröbner“. Universidade Federal de Sergipe, 2015. https://ri.ufs.br/handle/riufs/6524.
Der volle Inhalt der QuelleO objetivo principal desse trabalho é, usando bases de Gröbner, apresentar um método algébrico capaz de determinar a solução, quando existir, de sistemas de equações polinomiais não necessariamente lineares. Para tanto, necessitamos inicialmente apresentar alguns conceitos e teoremas ligados a anéis de polinômios com várias indeterminadas e de ideais monomiais, dentre os quais destacamos o algoritmo extendido da divisão, o teorema da Base de Hilbert e o algoritmo de Buchberger. Além disso, usando noções básicas da Teoria de eliminação e extensão, apresentamos uma solução algébrica para o problema da coloração de mapas usando três cores, bem como um solução geral para o puzzle Sudoku.
Hashemi, Amir. „Structure et compléxité des bases de Gröbner“. Paris 6, 2006. http://www.theses.fr/2006PA066116.
Der volle Inhalt der QuelleBender, Matias Rafael. „Algorithms for sparse polynomial systems : Gröbner bases and resultants“. Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS029.
Der volle Inhalt der QuelleSolving polynomial systems is one of the oldest and most important problems in computational mathematics and has many applications in several domains of science and engineering. It is an intrinsically hard problem with complexity at least single exponential in the number of variables. However, in most of the cases, the polynomial systems coming from applications have some kind of structure. In this thesis we focus on exploiting the structure related to the sparsity of the supports of the polynomials; that is, we exploit the fact that the polynomials only have a few monomials with non-zero coefficients. Our objective is to solve the systems faster than the worst case estimates that assume that all the terms are present. We say that a sparse system is unmixed if all its polynomials have the same Newton polytope, and mixed otherwise. Most of the work on solving sparse systems concern the unmixed case, with the exceptions of mixed sparse resultants and homotopy methods. In this thesis, we develop algorithms for mixed systems. We use two prominent tools in nonlinear algebra: sparse resultants and Groebner bases. We work on each theory independently, but we also combine them to introduce new algorithms: we take advantage of the algebraic properties of the systems associated to a non-vanishing resultant to improve the complexity of computing their Groebner bases; for example, we exploit the exactness of some strands of the associated Koszul complex to deduce an early stopping criterion for our Groebner bases algorithms and to avoid every redundant computation (reductions to zero). In addition, we introduce quasi-optimal algorithms to decompose binary forms
Rahmany, Sajjad. „Utilisation des bases de Gröbner SAGBI pour la résolution des systèmes polynômiaux invariants par symétries“. Paris 6, 2009. http://www.theses.fr/2009PA066214.
Der volle Inhalt der QuelleRocha, Junior Mauro Rodrigues. „Bases de Gröbner aplicadas a códigos corretores de erros“. Universidade Federal de Juiz de Fora (UFJF), 2017. https://repositorio.ufjf.br/jspui/handle/ufjf/5946.
Der volle Inhalt der QuelleApproved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-11-09T14:32:38Z (GMT) No. of bitstreams: 1 maurorodriguesrochajunior.pdf: 550118 bytes, checksum: 5b26ad1ab2bd9d4a190d742762346968 (MD5)
Made available in DSpace on 2017-11-09T14:32:38Z (GMT). No. of bitstreams: 1 maurorodriguesrochajunior.pdf: 550118 bytes, checksum: 5b26ad1ab2bd9d4a190d742762346968 (MD5) Previous issue date: 2017-08-11
O principal objetivo desse trabalho é estudar duas aplicações distintas das bases de Gröbner a códigos lineares. Com esse objetivo, estudamos como relacionar códigos a outras estruturas matemáticas, fazendo com que tenhamos novas ferramentas para a realização da codificação. Em especial, estudamos códigos cartesianos afins e os códigos algébrico-geométricos de Goppa.
The main objective of this work is to study two different applications of Gröbner basis to linear codes. With this purpose, we study how to relate codes to other mathematical structures, allowing us to use new tools to do the coding. In particular, we study affine cartesian codes e algebraic-geometric Goppa codes.
Sénéchaud, Pascale. „Calcul formel et parallélisme : bases de Gröbner booléennes, méthodes de calcul : applications, parallélisation“. Grenoble INPG, 1990. http://tel.archives-ouvertes.fr/tel-00337227.
Der volle Inhalt der QuelleGarcía, Fontán Jorge. „Singularity and Stability Analysis of vision-based controllers“. Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS015.
Der volle Inhalt der QuelleThe objective of this PhD thesis is to explore the failure cases of Image-Based Visual Servoing (IBVS), a class of Robotics controllers based on computer vision data. The failure cases arise from two sources: the singularities of the governing kinematic equations, and the existance of multiple stable points of equilibrium, which impacts the global asymptotic stability of the control laws. In this thesis, we study these two problems from a rigurous mathematical perspective and with the help of exact computational tools from algebraic geometry and computer algebra. Two main objectives were achieved. The first is to determine the conditions for singularity for the interaction model related to the observation of more than three straight lines in space, which extends the previous existing results for three lines. The second is the computation of the critical points (the equilibrium points) of IBVS in the observation of four reference points, as a first step towards an analysis of the global stability behaviour of visual servoing
Chakraborty, Olive. „Design and Cryptanalysis of Post-Quantum Cryptosystems“. Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS283.
Der volle Inhalt der QuellePolynomial system solving is one of the oldest and most important problems incomputational mathematics and has many applications in computer science. Itis intrinsically a hard problem with complexity at least single exponential in the number of variables. In this thesis, we focus on cryptographic schemes based on the hardness of this problem. In particular, we give the first known cryptanalysis of the Extension Field Cancellation cryptosystem. We work on the scheme from two aspects, first we show that the challenge parameters don’t satisfy the 80 bits of security claimed by using Gröbner basis techniques to solve the underlying algebraic system. Secondly, using the structure of the public keys, we develop a new technique to show that even altering the parameters of the scheme still keeps the scheme vulnerable to attacks for recovering the hidden secret. We show that noisy variant of the problem of solving a system of equations is still hard to solve. Finally, using this new problem to design a new multivariate key-exchange scheme as a candidate for NIST Post Quantum Cryptographic Standards
Thomas, Gabriel. „Contributions théoriques et algorithmiques à l'étude des équations différencielles-algébriques : Approche par le calcul formel“. Grenoble INPG, 1997. http://www.theses.fr/1997INPG0095.
Der volle Inhalt der QuelleIn this Computer Algebra thesis we develop the thoery of quasi-linear Differential-Algebraic Equations (DAEs) with polynomial coefficients. The existence of solutions to these systems is answered after differentiating the equations ; the minimal number of differentiations to get an integrable form is called the differential index by numerical analysts. In the first part, we make precise the definition of the differential index. By use of algebraic geometry and commutative algebra (modules over quotient rings) we show that the index depends on the irreducible components of the constraints variety of the original DAEs. The second part is devoted to algorithmic issues : we give an original and effective method of decomposing a quasi-linear polynomial DAEs into ODEs on equidimensional algebraic sets. For each subsystem, the index is computed, while both algebraic and differential parts are obtained without using the factorization of polynomials. This algorithm has been implemented with Maple and GB software. The other part of the thesis deals with the local study of so-called impasse points of non linear Differential Equations. These points are the standard singularities of quasi-linear DAEs. Taking a complex viewpoint, we show by simple calculations that impasse points are actually algebraic branch points of the soluions. Getting the multiplicity of these branch points from the determinant of the differential part, we show how to express the solution as a Puiseux expansion near a given impasse point
Bücher zum Thema "Base du Gröbner"
Hibi, Takayuki, Hrsg. Gröbner Bases. Tokyo: Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54574-3.
Der volle Inhalt der QuelleBecker, Thomas, und Volker Weispfenning. Gröbner Bases. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4612-0913-3.
Der volle Inhalt der QuelleSala, Massimiliano, Shojiro Sakata, Teo Mora, Carlo Traverso und Ludovic Perret, Hrsg. Gröbner Bases, Coding, and Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93806-4.
Der volle Inhalt der QuelleBruns, Winfried, Aldo Conca, Claudiu Raicu und Matteo Varbaro. Determinants, Gröbner Bases and Cohomology. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-05480-8.
Der volle Inhalt der Quelleservice), SpringerLink (Online, Hrsg. Gröbner bases, coding, and cryptography. Berlin: Springer, 2009.
Den vollen Inhalt der Quelle findenRadon Institute for Computational and Applied Mathematics und Special Semester on Gröbner Bases and Related Methods (2006 : Linz, Austria), Hrsg. Gröbner bases in symbolic analysis. Berlin: Walter De Gruyter, 2007.
Den vollen Inhalt der Quelle finden1947-, Herzog Jürgen, Hrsg. Gröbner bases in commutative algebra. Providence, R.I: American Mathematical Society, 2012.
Den vollen Inhalt der Quelle findenAdams, William W. An introduction to Gröbner bases. Providence, R.I: American Mathematical Society, 1994.
Den vollen Inhalt der Quelle findenSaito, Mutsumi. Gröbner deformations of hypergeometric differential equations. Berlin: Springer, 2000.
Den vollen Inhalt der Quelle findenKlin, Mikhail, Gareth A. Jones, Aleksandar Jurišić, Mikhail Muzychuk und Ilia Ponomarenko, Hrsg. Algorithmic Algebraic Combinatorics and Gröbner Bases. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01960-9.
Der volle Inhalt der QuelleBuchteile zum Thema "Base du Gröbner"
Collart, Stéphane, und Daniel Mall. „The ideal structure of Gröbner base computations“. In Integrating Symbolic Mathematical Computation and Artificial Intelligence, 156–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60156-2_12.
Der volle Inhalt der QuelleKoppenhagen, Ulla, und Ernst W. Mayr. „Optimal gröbner base algorithms for binomial ideals“. In Automata, Languages and Programming, 244–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61440-0_132.
Der volle Inhalt der QuelleHibi, Takayuki. „A Quick Introduction to Gröbner Bases“. In Gröbner Bases, 1–54. Tokyo: Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54574-3_1.
Der volle Inhalt der QuelleHamada, Tatsuyoshi. „Warm-Up Drills and Tips for Mathematical Software“. In Gröbner Bases, 55–106. Tokyo: Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54574-3_2.
Der volle Inhalt der QuelleNoro, Masayuki. „Computation of Gröbner Bases“. In Gröbner Bases, 107–63. Tokyo: Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54574-3_3.
Der volle Inhalt der QuelleAoki, Satoshi, und Akimichi Takemura. „Markov Bases and Designed Experiments“. In Gröbner Bases, 165–221. Tokyo: Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54574-3_4.
Der volle Inhalt der QuelleOhsugi, Hidefumi. „Convex Polytopes and Gröbner Bases“. In Gröbner Bases, 223–78. Tokyo: Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54574-3_5.
Der volle Inhalt der QuelleTakayama, Nobuki. „Gröbner Basis for Rings of Differential Operators and Applications“. In Gröbner Bases, 279–344. Tokyo: Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54574-3_6.
Der volle Inhalt der QuelleNakayama, Hiromasa, und Kenta Nishiyama. „Examples and Exercises“. In Gröbner Bases, 345–466. Tokyo: Springer Japan, 2013. http://dx.doi.org/10.1007/978-4-431-54574-3_7.
Der volle Inhalt der QuelleBecker, Thomas, und Volker Weispfenning. „Basics“. In Gröbner Bases, 1–13. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4612-0913-3_1.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Base du Gröbner"
Hu, Jing, Yuheng Lin und Xiwei Zhang. „Reversible Logic Synthesis Using Gröbner Base“. In 2019 IEEE 2nd International Conference on Electronics Technology (ICET). IEEE, 2019. http://dx.doi.org/10.1109/eltech.2019.8839444.
Der volle Inhalt der QuelleSartayev, Bauyrzhan, und Abdibek Ydyrys. „Free products of operads and Gröbner base of some operads“. In 2023 17th International Conference on Electronics Computer and Computation (ICECCO). IEEE, 2023. http://dx.doi.org/10.1109/icecco58239.2023.10147149.
Der volle Inhalt der QuelleKong, Xianwen. „Classification of 3-DOF 3-UPU Translational Parallel Mechanisms Based on Constraint Singularity Loci Using Gröbner Cover“. In ASME 2021 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/detc2021-70059.
Der volle Inhalt der QuelleKong, Xianwen. „Classification of a Class of 3-RER Parallel Manipulators Using Gröbner Cover and Primary Decomposition of Ideals“. In ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-98057.
Der volle Inhalt der QuelleCox, David A. „Gröbner bases“. In the 2007 international symposium. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1277548.1277601.
Der volle Inhalt der QuelleCastro-Jiménez, Francisco J., und M. Angeles Moreno-Frías. „Gröbner δ-bases and Gröbner bases for differential operators“. In Differential Galois Theory. Warsaw: Institute of Mathematics Polish Academy of Sciences, 2002. http://dx.doi.org/10.4064/bc58-0-4.
Der volle Inhalt der QuelleDhingra, A. K., A. N. Almadi und D. Kohli. „Displacement Analysis of Multi-Loop Mechanisms Using Gröbner Bases“. In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/mech-5906.
Der volle Inhalt der QuelleArikawa, Keisuke. „Kinematic Analysis of Mechanisms Based on Parametric Polynomial System“. In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85347.
Der volle Inhalt der QuelleFaugère, Jean-Charles, Pierre-Jean Spaenlehauer und Jules Svartz. „Sparse Gröbner bases“. In the 39th International Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2608628.2608663.
Der volle Inhalt der QuelleKapur, Deepak, Yao Sun und Dingkang Wang. „Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously“. In the 36th international symposium. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1993886.1993918.
Der volle Inhalt der Quelle