Academic literature on the topic '010101 Algebra and Number Theory'

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 '010101 Algebra and Number Theory.'

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 "010101 Algebra and Number Theory"

1

W., H. C., and Michael Pohst. "Algorithmic Methods in Algebra and Number Theory." Mathematics of Computation 55, no. 192 (1990): 876. http://dx.doi.org/10.2307/2008461.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Passow, Eli, and Theodore J. Rivlin. "Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory." Mathematics of Computation 58, no. 198 (1992): 859. http://dx.doi.org/10.2307/2153227.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Askey, Richard. "CHEBYSHEV POLYNOMIALS From Approximation Theory to Algebra and Number Theory." Bulletin of the London Mathematical Society 23, no. 3 (1991): 311–12. http://dx.doi.org/10.1112/blms/23.3.311.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Borwein, Peter B. "Chebyshev polynomials: From approximation theory to algebra and number theory." Journal of Approximation Theory 66, no. 3 (1991): 353. http://dx.doi.org/10.1016/0021-9045(91)90038-c.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Charafi, A. "Chebyshev polynomials—From approximation theory to algebra and number theory." Engineering Analysis with Boundary Elements 9, no. 2 (1992): 190. http://dx.doi.org/10.1016/0955-7997(92)90065-f.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

DOMOKOS, MÁTYÁS, and VESSELIN DRENSKY. "CONSTRUCTIVE NONCOMMMUTATIVE INVARIANT THEORY." Transformation Groups 26, no. 1 (2021): 215–28. http://dx.doi.org/10.1007/s00031-021-09643-2.

Full text
Abstract:
AbstractThe problem of finding generators of the subalgebra of invariants under the action of a group of automorphisms of a finite-dimensional Lie algebra on its universal enveloping algebra is reduced to finding homogeneous generators of the same group acting on the symmetric tensor algebra of the Lie algebra. This process is applied to prove a constructive Hilbert–Nagata Theorem (including degree bounds) for the algebra of invariants in a Lie nilpotent relatively free associative algebra endowed with an action induced by a representation of a reductive group.
APA, Harvard, Vancouver, ISO, and other styles
7

Bezushchak, O. O., and B. V. Oliynyk. "Algebraic theory of measure algebras." Reports of the National Academy of Sciences of Ukraine, no. 2 (May 3, 2023): 3–9. http://dx.doi.org/10.15407/dopovidi2023.02.003.

Full text
Abstract:
A. Horn and A. Tarski initiated the abstract theory of measure algebras. Independently V. Sushchansky, B. Oliynyk and P. Cameron studied the direct limits of Hamming spaces. In the current paper, we introduce new examples of locally standard measure algebras and complete the classification of countable locally standard measure algebras. Countable unital locally standard measure algebras are in one-to-one correspondence with Steinitz numbers. Given a Steinitz number s such measure algebra is isomorphic to the Boolean algebra of s-periodic sequences of 0 and 1. Nonunital locally standard measure algebras are parametrized by pairs (s, r), where s is a Steinitz number and r is a real number greater or equal to 1. We also show that an arbitrary (not necessarily locally standard) measure algebra is embeddable in a metric ultraproduct of standard Hamming spaces. In other words, an arbitrary measure algebra is sofic.
APA, Harvard, Vancouver, ISO, and other styles
8

Charnow, A., and E. Charnow. "69.40 An Application of Algebra to Number Theory." Mathematical Gazette 69, no. 450 (1985): 292. http://dx.doi.org/10.2307/3617580.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Бедратюк, Леонід Петрович, and Ганна Іванівна Бедратюк. "Computer algebra systems in the elementary number theory." Eastern-European Journal of Enterprise Technologies 6, no. 4(66) (2013): 10–13. http://dx.doi.org/10.15587/1729-4061.2013.18892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cheung, Y. L. "Learning number theory with a computer algebra system." International Journal of Mathematical Education in Science and Technology 27, no. 3 (1996): 379–85. http://dx.doi.org/10.1080/0020739960270308.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "010101 Algebra and Number Theory"

1

PASINI, FEDERICO WILLIAM. "Classifying spaces for knots: new bridges between knot theory and algebraic number theory." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2016. http://hdl.handle.net/10281/129230.

Full text
Abstract:
In this thesis we discuss how, in the context of knot theory, the classifying space of a knot group for the family of meridians arises naturally. We provide an explicit construction of a model for that space, which is particularly nice in the case of a prime knot. We then show that this classifying space controls the behaviour of the finite branched coverings of the knot. We present a 9-term exact sequence for knot groups that strongly resembles the Poitou-Tate exact sequence for algebraic number fields. Finally, we show that the homology of the classifying space behaves towards the former sequence as Shafarevich groups do towards the latter.
APA, Harvard, Vancouver, ISO, and other styles
2

BATTISTONI, FRANCESCO. "APPLICATIONS OF PRIME DENSITIES IN NUMBER THEORY AND CLASSIFICATION OF NUMBER FIELDS WITH BOUNDED INVARIANTS." Doctoral thesis, Università degli Studi di Milano, 2020. http://hdl.handle.net/2434/703505.

Full text
Abstract:
This Ph.D. thesis collects the author's works and interests in several parts of Number Theory, from algebraic problems related to relations between number fields which are based on the factorization of prime numbers in the rings of integers, up to the application of tools concerning the density of primes with given splitting type in number fields to the computation of the average rank of specific families of elliptic curves, concluding finally with the classification and estimate of the main invariants of a number field, like the discriminant and the regulator, pursued by means of analytic formulas and algorithmic methods developed on the previous tools and implemented on suitable computer algebra systems, like PARI/GP.
APA, Harvard, Vancouver, ISO, and other styles
3

Bingham, Aram. "Commutative n-ary Arithmetic." ScholarWorks@UNO, 2015. http://scholarworks.uno.edu/td/1959.

Full text
Abstract:
Motivated by primality and integer factorization, this thesis introduces generalizations of standard binary multiplication to commutative n-ary operations based upon geometric construction and representation. This class of operations are constructed to preserve commutativity and identity so that binary multiplication is included as a special case, in order to preserve relationships with ordinary multiplicative number theory. This leads to a study of their expression in terms of elementary symmetric polynomials, and connections are made to results from the theory of polyadic (n-ary) groups. Higher order operations yield wider factorization and representation possibilities which correspond to reductions in the set of primes as well as tiered notions of primality. This comes at the expense of familiar algebraic properties such as associativity, and unique factorization. Criteria for primality and a naive testing algorithm are given for the ternary arithmetic, drawing heavily upon modular arithmetic. Finally, connections with the theory of partitions of integers and quadratic forms are discussed in relation to questions about cardinality of primes.
APA, Harvard, Vancouver, ISO, and other styles
4

Sordo, Vieira Luis A. "ON P-ADIC FIELDS AND P-GROUPS." UKnowledge, 2017. http://uknowledge.uky.edu/math_etds/43.

Full text
Abstract:
The dissertation is divided into two parts. The first part mainly treats a conjecture of Emil Artin from the 1930s. Namely, if f = a_1x_1^d + a_2x_2^d +...+ a_{d^2+1}x^d where the coefficients a_i lie in a finite unramified extension of a rational p-adic field, where p is an odd prime, then f is isotropic. We also deal with systems of quadratic forms over finite fields and study the isotropicity of the system relative to the number of variables. We also study a variant of the classical Davenport constant of finite abelian groups and relate it to the isotropicity of diagonal forms. The second part deals with the theory of finite groups. We treat computations of Chermak-Delgado lattices of p-groups. We compute the Chermak-Delgado lattices for all p-groups of order p^3 and p^4 and give results on p-groups of order p^5.
APA, Harvard, Vancouver, ISO, and other styles
5

Alnominy, Madai Obaid. "Monomial Progenitors and Related Topics." CSUSB ScholarWorks, 2018. https://scholarworks.lib.csusb.edu/etd/619.

Full text
Abstract:
The main objective of this project is to find the original symmetric presentations of some very important finite groups and to give our constructions of some of these groups. We have found the Mathieu sporadic group M11, HS × D5, where HS is the sporadic group Higman-Sim group, the projective special unitary group U(3; 5) and the projective special linear group L2(149) as homomorphic images of the monomial progenitors 11*4 :m (5 :4), 5*6 :m S5 and 149*2 :m D37. We have also discovered 24 : S3 × C2, 24 : A5, (25 : S4), 25 : S3 × S3, 33 : S4 × C2, S6, 29: PGL(2,7), 22 • (S6 : S6), PGL(2,19), ((A5 : A5 × A5) : D6), 6 • (U4(3): 2), 2 • PGL(2,13), S7, PGL (2,8), PSL(2,19), 2 × PGL(2,81), 25 : (S6 × A5), 26 : S4 × D3, U(4,3), 34 : S4, 32 :D6, 2 • (PGL(2,7) :PSL(2,7), 22 : (S5 : S5) and 23 : (PSL3(4) : 2) as homomorphic images of the permutation progenitors 2*8 : (2 × 4 : 2), 2*16: (2 × 4 :C2 × C2), 2*9: (S3 × S3), 2*9: (S3 × A3), 2*9: (32 × 23) and 2*9: (33 × A3). We have also constructed 24: S3 × C2, 24 : A5, (25: S4), 25 : S3 × S3,: 33: S4 × C2, S6, M11 and U (3,5) by using the technique of double coset enumeration. We have determined the isomorphism types of the most of the images mentioned in this thesis. We demonstrate our work for the following examples: 34 : (32 * 23) × 2, 29 : PGL(2,7), 2•S6, (54 : (D4 × S3)), and 3: •PSL(2,19) ×2.
APA, Harvard, Vancouver, ISO, and other styles
6

Salt, Brittney M. "MONOID RINGS AND STRONGLY TWO-GENERATED IDEALS." CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/31.

Full text
Abstract:
This paper determines whether monoid rings with the two-generator property have the strong two-generator property. Dedekind domains have both the two-generator and strong two-generator properties. How common is this? Two cases are considered here: the zero-dimensional case and the one-dimensional case for monoid rings. Each case is looked at to determine if monoid rings that are not PIRs but are two-generated have the strong two-generator property. Full results are given in the zero-dimensional case, however only partial results have been found for the one-dimensional case.
APA, Harvard, Vancouver, ISO, and other styles
7

Constable, Jonathan A. "Kronecker's Theory of Binary Bilinear Forms with Applications to Representations of Integers as Sums of Three Squares." UKnowledge, 2016. http://uknowledge.uky.edu/math_etds/35.

Full text
Abstract:
In 1883 Leopold Kronecker published a paper containing “a few explanatory remarks” to an earlier paper of his from 1866. His work loosely connected the theory of integral binary bilinear forms to the theory of integral binary quadratic forms. In this dissertation we discover the statements within Kronecker's paper and offer detailed arithmetic proofs. We begin by developing the theory of binary bilinear forms and their automorphs, providing a classification of integral binary bilinear forms up to equivalence, proper equivalence and complete equivalence. In the second chapter we introduce the class number, proper class number and complete class number as well as two refinements, which facilitate the development of a connection with binary quadratic forms. Our third chapter is devoted to deriving several class number formulas in terms of divisors of the determinant. This chapter also contains lower bounds on the class number for bilinear forms and classifies when these bounds are attained. Lastly, we use the class number formulas to rigorously develop Kronecker's connection between binary bilinear forms and binary quadratic forms. We supply purely arithmetic proofs of five results stated but not proven in the original paper. We conclude by giving an application of this material to the number of representations of an integer as a sum of three squares and show the resulting formula is equivalent to the well-known result due to Gauss.
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

Munoz, Susana L. "A Fundamental Unit of O_K." CSUSB ScholarWorks, 2015. https://scholarworks.lib.csusb.edu/etd/133.

Full text
Abstract:
In the classical case we make use of Pells equation to compute units in the ring OF. Consider the parallel to the classical case and the quadratic field extension that creates the ring OK. We use the generalized Pell's equation to find the units in this ring since they are solutions. Through the use of continued fractions we may further characterize this ring and compute its units.
APA, Harvard, Vancouver, ISO, and other styles
10

COSCELLI, EDOARDO. "STICKELBERGER SERIES AND IWASAWA MAIN CONJECTURE FOR FUNCTION FIELDS." Doctoral thesis, Università degli Studi di Milano, 2018. http://hdl.handle.net/2434/561439.

Full text
Abstract:
Let F be a global function field in characteristic p>0. There exists many different types of L-functions that can be associated to F, such as the Artin L-functions, the Goss Zeta function or the p-adic L-functions. In this work i have investigated the correlations between these analytic objects and the Stickelberger series, which is a formal power series whose coefficients lie in a suitable Galois algebra. In the second part of this work i have studied the Iwasawa extension generated by the p-torsion of a Hayes module and i have used the Stickelberger series to prove a "main conjecture" for the p-part of the class group.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "010101 Algebra and Number Theory"

1

Frey, Gerhard, and Jürgen Ritter, eds. Algebra and Number Theory. DE GRUYTER, 1994. http://dx.doi.org/10.1515/9783110878103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tandon, Rajat, ed. Algebra and Number Theory. Hindustan Book Agency, 2005. http://dx.doi.org/10.1007/978-93-86279-23-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zimmer, Horst G., ed. Group Theory, Algebra, and Number Theory. DE GRUYTER, 1996. http://dx.doi.org/10.1515/9783110811957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bosma, Wieb, and Alf van der Poorten, eds. Computational Algebra and Number Theory. Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-017-1108-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Larcher, Gerhard, Friedrich Pillichshammer, Arne Winterhof, and Chaoping Xing, eds. Applied Algebra and Number Theory. Cambridge University Press, 2014. http://dx.doi.org/10.1017/cbo9781139696456.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Matzat, B. Heinrich, Gert-Martin Greuel, and Gerhard Hiss, eds. Algorithmic Algebra and Number Theory. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-59932-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bosma, Wieb. Computational Algebra and Number Theory. Springer Netherlands, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wieb, Bosma, and Van Der Poorten, A. J., eds. Computational algebra and number theory. Kluwer Academic, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

C, Washington Lawrence, ed. Elementary number theory. CRC Press, Taylor & Francis Group, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

1891-, Vinogradov Ivan Matveevich, ed. Algebra, mathematical logic, number theory, topology. American Mathematical Society, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "010101 Algebra and Number Theory"

1

Lawson, Mark V. "Number Theory." In Algebra & Geometry, 2nd ed. Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003098072-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gårding, Lars, and Torbjörn Tambour. "Number theory." In Algebra for Computer Science. Springer US, 1988. http://dx.doi.org/10.1007/978-1-4613-8797-8_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tuset, Lars. "Number Theory." In Abstract Algebra via Numbers. Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-74623-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mignotte, Maurice. "Number Theory, Complements." In Mathematics for Computer Algebra. Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4613-9171-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rowen, Louis Halle, and Uzi Vishne. "Applications: Famous Results from Number Theory." In Algebra, 2nd ed. Chapman and Hall/CRC, 2025. https://doi.org/10.1201/9780429278655-20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Knapp, Anthony W. "Transition to Modern Number Theory." In Advanced Algebra. Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4613-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Delfs, Hans, and Helmut Knebl. "Algebra and Number Theory." In Information Security and Cryptography. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-87126-9_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gårding, Lars, and Torbjörn Tambour. "Number theory and computing." In Algebra for Computer Science. Springer US, 1988. http://dx.doi.org/10.1007/978-1-4613-8797-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Knapp, Anthony W. "Three Theorems in Algebraic Number Theory." In Advanced Algebra. Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4613-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Knapp, Anthony W. "The Number Theory of Algebraic Curves." In Advanced Algebra. Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4613-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "010101 Algebra and Number Theory"

1

Erkoç, Temha. "Preface to Algebra and Number Theory." In THIRD INTERNATIONAL CONFERENCE OF MATHEMATICAL SCIENCES (ICMS 2019). AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5136226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

KOLODNYTSKY, M., A. KOVALCHUK, S. KURYATA, and V. LEVITSKY. "THE MATHEMATICAL SOFTWARE IMPLEMENTATION FOR COMPUTATIONAL ALGEBRA AND NUMBER THEORY." In Proceedings of the Fourth Asian Symposium (ASCM 2000). WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812791962_0039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gajdos, A., J. Hanc, and M. Hancova. "Interactive Jupyter Notebooks with SageMath in Number Theory, Algebra, Calculus, and Numerical Methods." In 2022 20th International Conference on Emerging eLearning Technologies and Applications (ICETA). IEEE, 2022. http://dx.doi.org/10.1109/iceta57911.2022.9974868.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

HILTON, PETER, JEAN PEDERSEN, and BYRON WALDEN. "PAPER-FOLDING, POLYGONS, COMPLETE SYMBOLS, AND THE EULER TOTIENT FUNCTION: AN ONGOING SAGA CONNECTING GEOMETRY, ALGEBRA, AND NUMBER THEORY." In Proceedings of the Second International Congress in Algebra and Combinatorics. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812790019_0010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Novak, Vilem. "Formal theory of quantifiers in natural language and their syllogisms." In 38th ECMS International Conference on Modelling and Simulation. ECMS, 2024. http://dx.doi.org/10.7148/2024-0007.

Full text
Abstract:
Quantifiers occur in natural language as expressions using which we quantify a number of some objects in a given universe. A special class of them are intermediate quantifiers, for example, many, most, almost all, a few, a little and others. A detailed elaboration of the latter is provided in Peterson (2000). Their formal theory was established in (Novák, 2008). According to it, intermediate quantifiers form a special theory TIQ of higher-order fuzzy logic (fuzzy type theory) (FTT) with models based on the standard Łukasiewicz MVΔ-algebra.
APA, Harvard, Vancouver, ISO, and other styles
6

A. N., Rybalov. "GENERIC COMPLEXITY OF ALGORITHMIC PROBLEMS." In Mechanical Science and Technology Update. Omsk State Technical University, 2022. http://dx.doi.org/10.25206/978-5-8149-3453-6-2022-10-14.

Full text
Abstract:
Generic approach is one of the approaches to the study of algorithmic problems for almost all inputs, born at the intersection of computational algebra and computer science. Within the framework of this approach, algorithms are studied that solve a problem for almost all inputs, and for the remaining rare inputs give an undefined answer. This review reflects two areas of research of generic complexity of algorithmic problems in algebra, mathematical logic, number theory, and theoretical computer science. The first direction is devoted to the construction of generic algorithms for problems that are unsolvable and hard in the classical sense. In the second direction, algorithmic problems are sought that remain unsolvable or hard even in the generic sense. Such problems are important in cryptography.
APA, Harvard, Vancouver, ISO, and other styles
7

Ciblak, Namik, and Harvey Lipkin. "Synthesis of Stiffnesses by Springs." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/mech-5879.

Full text
Abstract:
Abstract A new, systematic approach to the synthesis of stiffness by springs is presented using screw (spatial vector) algebra. The space of solutions is fully characterized for all stiffnesses realizable by springs. The main result shows that a rank r stiffness can always be synthesized by r springs. Further, a stiffness can be synthesized by an arbitrarily large number of springs greater than r. Algorithms and numerical results support the theory.
APA, Harvard, Vancouver, ISO, and other styles
8

Huang, Chintien, and Bernard Roth. "Position-Force Synthesis of Closed-Loop Linkages." In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0303.

Full text
Abstract:
Abstract The dimensional synthesis of spatial closed-loop linkages to match both force and position specifications is investigated. An efficient means of formulating force equations is introduced through the application of linear algebra to screw theory. The synthesis of spatial four-bar linkages is discussed in detail; it is shown that the maximum number of allowable design positions is not decreased after force constraints are imposed on classical position synthesis problems.
APA, Harvard, Vancouver, ISO, and other styles
9

Aguilera, Daniel, Jose´ Mari´a Rico, and Jaime Gallardo. "Computer Implementation of an Improved Kutzbach-Gru¨bler Mobility Criterion." In ASME 2002 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/detc2002/dac-34093.

Full text
Abstract:
Recent results have shown that the application of group theory to the Euclidean group, E(3), and its subgroups yields a new and improved mobility criterion. Unlike the well known Kutzbach-Gru¨bler criterion, this improved mobility criterion yields correct results for both trivial and exceptional linkages. Unfortunately, this improved mobility criterion requires a little bit more than counting links and kinematic pairs. An important advance was made when it was proved that the improved mobility criterion, originally stated in a language of group theory and subsets and subgroups of the Euclidean group, E(3), can be translated into a language of the Lie algebra, e(3), of the Euclidean group, E(3), and its vector subspaces and its subalgebras. The language of the Lie algebra, e(3), is far simpler than the nonlinear language of the Euclidean group, E(3). Still, the computations required for the improved mobility criterion are more involved than those required for the Kutzbach-Gru¨bler criterion, and it might preclude the employment of the improved mobility criterion in prospective tasks such as the number synthesis of parallel and modular manipulators. This contribution dispels these doubts by showing that the improved criterion can be easily implemented by a simple computer program. Several examples are included.
APA, Harvard, Vancouver, ISO, and other styles
10

Massari, Mauro, Davide Invernizzi, Marco Lovera, Pietro Ghignoni, and Lorenzo Ticozzi. "Robust Control of Free-Flying Space Manipulator for Capturing Uncontrolled Thumbling Objects." In ESA 12th International Conference on Guidance Navigation and Control and 9th International Conference on Astrodynamics Tools and Techniques. ESA, 2023. http://dx.doi.org/10.5270/esa-gnc-icatt-2023-146.

Full text
Abstract:
The potential of In-Orbit Servicing (IOS) to extend the operational life of satellites and the need to implement Active Debris Removal (ADR) to effectively tackle the space debris problem are well known among the space community. Research on technical solutions to enable this class of missions is thriving, also pushed by the development of new control systems. Several solutions have been proposed over the years to safely capture orbital objects, the majority of which rely on robotic systems. A promising solution is the employment of an autonomous spacecraft (chaser) equipped with a highly dexterous robotic arm able to perform the berthing with a resident space object. In this respect, the design of an effective, reliable, and robust Guidance Navigation and Control (GNC) system, for which several architectures and hardware configurations are possible, plays a key role to ensure a safe mission execution. The proposed solution aims at the implementation of a combined control strategy wherein the spacecraft base and the robotic arm are controlled together. As shown by recent works, a combined architecture has several advantages over decoupled control strategies, from fuel efficiency improvement to performance improvement. Robust control methods are adopted to design control laws for the uncertain, nonlinear dynamics of the chaser and of the complete chaser-target stack after capture. Space robots are characterized by a high level of complexity due to the kinematic and dynamic coupling between its elements. The motion of a single body (be it the base or one of the links) is transmitted downstream (in the direction of the end-effector) according to the properties of the kinematic chain, while it dynamically affects the system also in the upstream direction (towards the satellite-base). From a practical standpoint this means that, unlike ground-fixed robots, the motion of the manipulator causes a motion of the base. Keeping these aspects in mind, the dynamic model of a space robot is mostly built upon the traditional theory of rigid multibody system. In this work a recursive method has been applied to the system of interconnected rigid bodies which, unlike the direct equivalent, models the interconnections in terms of forces and kinematic constraints acting at a single-body level. This results in a large set of equations which can be solved by exploiting recurrence relations descending from the tree-like structure of the system. The proposed recursive method leverages a floating-base version of both the Newton-Euler algorithm (RNEA) and the composite rigid-body algorithm (CRBA); in particular, spatial vector algebra has been used to increase compactness and efficiency of the algorithms. Following this approach, a rigid multi-body model of the system has been developed including the chaser platform and a 7 degrees-of-freedom redundant manipulator mounted on the spacecraft base. As for control design, the chosen architecture is based on a combined approach wherein base and manipulator states are controlled together, following ideas recently proposed in the literature. The specific approach developed in this work consists in using nonlinear control laws, based on extensions of the well–known computed torque controller to space robot, together with a systematic tuning procedure based on the H-Infinity framework. Indeed, while computed torque controllers deliver good tracking performance in a large domain of operating conditions, they suffer from modelling uncertainty (they are based feedback linearization) and no rule is given to tune the gains of the feedback component of the control law, which is typically based on a (nonlinear) Proportional Derivative (PD) law. Hence, trial and error procedures are often employed in practice to select the gains and achieve acceptable performance. Such an approach is made more challenging by the large number of states of space robots. Therefore, the following systematic tuning approach has been considered: first, both the plant and the control law are linearized about a nominal operating point and a linear uncertain description of the closed–loop system is derived; then, the gains of the control law are tuned by leveraging the structured H∞ framework. In this manner, the control law handles by design the rigid body nonlinearities while performance requirements can be imposed in the neighborhood of the desired configurations when tuning the gains. The proposed synthesis approach allows accounting for dynamics effects at synthesis time, such as sloshing, actuator dynamics, flexibility, orbital dynamics, which are neglected when deriving the nonlinear control law. The proposed robust control is designed in joint space and thus requires computing a reference trajectory in joint space. However, the capture of uncontrolled thumbling objects poses requirements to the trajectory generation in task space. A trajectory generation for the end effector in task space is proposed together with an inverse kinematic approach which exploits the manipulator redundancy to locally optimize the manipulability index. In addition, a feedback term is added in the inverse kinematic algorithm to make up for possible location and attitude errors, according to the Closed-Loop Inverse Kinematics (CLIK) algorithm. As the target is in an uncontrolled thumbling state, the reference trajectory generation is generated propagating forward in time the target motion, but continuously updating the propagation with information on the current state of the target coming from the Navigation System. After the controller synthesis, a robustness analysis with respect to rigid-body uncertainties (mass, moments of inertia (MoI), products of inertia (PoI) and center of mass (CoM) position) and sloshing is performed, while the performances of the proposed controller are evaluated on a representative scenario for the capturing of an uncontrolled thumbling object using a full nonlinear model of the dynamics.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "010101 Algebra and Number Theory"

1

Sultanov, S. R. Electronic textbook " Algebra and number theory. Part 2 "direction of training 02.03.03" Mathematical support and administration of information systems". OFERNIO, 2018. http://dx.doi.org/10.12731/ofernio.2018.23685.

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!