Log in

Relevant bibliographies by topics / Conjugate elements / Journal articles

To see the other types of publications on this topic, follow the link: Conjugate elements.

Journal articles on the topic 'Conjugate elements'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Conjugate elements.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Steinberg, Benjamin. "Linear Conjugacy." Canadian Mathematical Bulletin 62, no. 4 (2019): 886–95. http://dx.doi.org/10.4153/s0008439519000031.

Full text

Abstract:

AbstractWe say that two elements of a group or semigroup are $\Bbbk$-linear conjugates if their images under any linear representation over $\Bbbk$ are conjugate matrices. In this paper we characterize $\Bbbk$-linear conjugacy for finite semigroups (and, in particular, for finite groups) over an arbitrary field $\Bbbk$.

APA, Harvard, Vancouver, ISO, and other styles

2

Modi, Mitra, Mathew Seedhom, and Alexander Ushakov. "Linear time algorithm for the conjugacy problem in the first Grigorchuk group." International Journal of Algebra and Computation 31, no. 04 (2021): 789–806. http://dx.doi.org/10.1142/s0218196721500363.

Full text

Abstract:

We prove that the conjugacy problem in the first Grigorchuk group [Formula: see text] can be solved in linear time. Furthermore, the problem to decide if a list of elements [Formula: see text] contains a pair of conjugate elements can be solved in linear time. We also show that a conjugator for a pair of conjugate element [Formula: see text] can be found in polynomial time.

APA, Harvard, Vancouver, ISO, and other styles

3

Gupta, C. K., N. D. Gupta, and F. Levin. "On conjugacy p-separability of free centre-by-metabelian groups." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 47, no. 2 (1989): 334–42. http://dx.doi.org/10.1017/s1446788700031761.

Full text

Abstract:

AbstractA group G is said to be conjugacy p-separable if two non-conjugate elements of G remain non-conjugate in some finite p-group endomorphic image of G. We show that the non-cyclic free centre-by-metabelian groups are not conjugacy p-separable for any prime p. On the other hand, we show that every free centre-by-metabelian group has the solvable conjugacy problem

APA, Harvard, Vancouver, ISO, and other styles

4

Yangertola, Yangertola, and Kuntala Patra. "Conjugacy classes and conjugate graph of a K-metacyclic group." International Journal of ADVANCED AND APPLIED SCIENCES 10, no. 11 (2023): 176–83. http://dx.doi.org/10.21833/ijaas.2023.11.022.

Full text

Abstract:

The relationship between algebraic structures and graphs has become an interesting topic of research nowadays. In this paper, we have considered the conjugate graph related to the conjugacy relation of a group. The vertices of the said graph are the noncentral elements of the group, and two vertices are adjacent if they are conjugate. For this particular study, we focused on the conjugate graph of a K-metacyclic group of order p(p-1). We first determine the conjugacy classes of this group and then obtain its conjugate graph. Various graph properties such as planarity, line graph, complement gr

APA, Harvard, Vancouver, ISO, and other styles

5

Najmuddin, Nabilah, Nor Haniza Sarmin, and Ahmad Erfanian. "General Form of Domination Polynomial for Two Types of Graphs Associated to Dihedral Groups." MATEMATIKA 35, no. 2 (2019): 149–55. http://dx.doi.org/10.11113/matematika.v35.n2.1106.

Full text

Abstract:

A domination polynomial is a type of graph polynomial in which its coefficients represent the number of dominating sets in the graph. There are many researches being done on the domination polynomial of some common types of graphs but not yet for graphs associated to finite groups. Two types of graphs associated to finite groups are the conjugate graph and the conjugacy class graph. A graph of a group G is called a conjugate graph if the vertices are non-central elements of G and two distinct vertices are adjacent if they are conjugate to each other. Meanwhile, a conjugacy class graph of a gro

APA, Harvard, Vancouver, ISO, and other styles

6

Hui, Chun Yin, та Krishna Kishore. "Torsion elements of order 𝑝2 in the Nottingham group". Journal of Group Theory 23, № 3 (2020): 489–502. http://dx.doi.org/10.1515/jgth-2019-0114.

Full text

Abstract:

AbstractLet κ be a characteristic p finite field of q elements and {\mathfrak{N}_{\kappa}} the Nottingham group over κ. Lubin associated to every conjugacy class of torsion element of {\mathfrak{N}_{\kappa}} a type. We establish an upper bound {B(q;l,m)} on the number of conjugacy classes of order {p^{2}} torsion elements u of {\mathfrak{N}_{\kappa}} of type {\langle l,m\rangle}. In the case where {l<p}, the bound {B(q;l,m)} is the exact number of conjugacy classes. Moreover, we give a criterion on when u and {u^{n}} are conjugate.

APA, Harvard, Vancouver, ISO, and other styles

7

Lin, Yi, Xiuping Jiang, Tara Elkin, et al. "Carbon Nanotubes for Immunomagnetic Separation of Escherichia Coli O157:H7." Journal of Nanoscience and Nanotechnology 6, no. 3 (2006): 868–71. http://dx.doi.org/10.1166/jnn.2006.130.

Full text

Abstract:

Bovine serum albumin-functionalized multiple-walled carbon nanotubes with encapsulated ferromagnetic elements were conjugated with pathogen-specific antibody, and the conjugate was evaluated for immunomagnetic separation of Escherichia coli O157:H7 in pure and mixed (with Salmonella Typhimurium) cultures.

APA, Harvard, Vancouver, ISO, and other styles

8

Pestov, G. G. "On the problem of conjugate elements." Russian Mathematical Surveys 42, no. 3 (1987): 228. http://dx.doi.org/10.1070/rm1987v042n03abeh001432.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Benwen, Huang, and Yao Yongqiao. "Conjugate class of elements inA 6." Wuhan University Journal of Natural Sciences 4, no. 1 (1999): 5–7. http://dx.doi.org/10.1007/bf02827609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zhang, J. P. "Finite Groups With Many Conjugate Elements." Journal of Algebra 170, no. 2 (1994): 608–24. http://dx.doi.org/10.1006/jabr.1994.1356.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bumagin, Inna. "Time complexity of the conjugacy problem in relatively hyperbolic groups." International Journal of Algebra and Computation 25, no. 05 (2015): 689–723. http://dx.doi.org/10.1142/s0218196715500162.

Full text

Abstract:

If u and v are two conjugate elements of a hyperbolic group then the length of a shortest conjugating element for u and v can be bounded by a linear function of the sum of their lengths, as was proved by Lysenok in [Some algorithmic properties of hyperbolic groups, Izv. Akad. Nauk SSSR Ser. Mat. 53(4) (1989) 814–832, 912]. Bridson and Haefliger showed in [Metrics Spaces of Non-Positive Curvature (Springer-Verlag, Berlin, 1999)] that in a hyperbolic group the conjugacy problem can be solved in polynomial time. We extend these results to relatively hyperbolic groups. In particular, we show that

APA, Harvard, Vancouver, ISO, and other styles

12

Kim, Raeyong. "Conjugacy Problem in the Fundamental Groups of High-Dimensional Graph Manifolds." Mathematics 9, no. 12 (2021): 1330. http://dx.doi.org/10.3390/math9121330.

Full text

Abstract:

The conjugacy problem for a group G is one of the important algorithmic problems deciding whether or not two elements in G are conjugate to each other. In this paper, we analyze the graph of group structure for the fundamental group of a high-dimensional graph manifold and study the conjugacy problem. We also provide a new proof for the solvable word problem.

APA, Harvard, Vancouver, ISO, and other styles

13

Poizat, Bruno, and Frank Wagner. "Sous-groupes periodiques d'un groupe stable." Journal of Symbolic Logic 58, no. 2 (1993): 385–400. http://dx.doi.org/10.2307/2275211.

Full text

Abstract:

AbstractWe develop a Sylow theory for stable groups satisfying certain additional conditions (2- finiteness, solvability or smallness) and show that their maximal p-subgroups are locally finite and conjugate. Furthermore, we generalize a theorem of Baer-Suzuki on subgroups generated by a conjugacy class of p-elements.

APA, Harvard, Vancouver, ISO, and other styles

14

van Deurs, B., T. I. Tønnessen, O. W. Petersen, K. Sandvig, and S. Olsnes. "Routing of internalized ricin and ricin conjugates to the Golgi complex." Journal of Cell Biology 102, no. 1 (1986): 37–47. http://dx.doi.org/10.1083/jcb.102.1.37.

Full text

Abstract:

Receptor-mediated endocytosis and intracellular routing of native ricin, and of ricin conjugated to colloidal gold (Ri-Au) and to horseradish peroxidase (Ri-HRP), have been studied in cultured MCF-7 and Vero cells by electron microscopical techniques including serial section analysis. Both native ricin, as demonstrated by immunoperoxidase cytochemistry, and the ricin conjugates were internalized via a common coated pit-coated vesicle pathway to reach vacuolar and tubulo-vesicular portions of the endosomal system. In addition, native ricin and a purified monovalent fraction of Ri-HRP reached di

APA, Harvard, Vancouver, ISO, and other styles

15

Kumar, Chinmayee, and Kuntala Patra. "Conjugate Graph and Conjugacy Class Graph related to Direct Product of Dihedral Groups." WSEAS TRANSACTIONS ON MATHEMATICS 23 (July 19, 2024): 458–66. http://dx.doi.org/10.37394/23206.2024.23.48.

Full text

Abstract:

Let 𝐺 be a non-abelian group. The conjugate graph of 𝐺 is a graph whose vertices are the noncentral elements of 𝐺 and two vertices are adjacent if they belong to the same conjugacy class. The conjugacy class graph of 𝐺 is a graph whose vertices are the non-central conjugacy classes of 𝐺 and two vertices 𝑎, 𝑏 are adjacent if 𝑔𝑐𝑑(|𝑎|, |𝑏|) is greater than one. In this paper, we explore the structures of these graphs for the groups 𝐷𝑛 × 𝐷𝑚 for odd and even values of 𝑛 and 𝑚. The chromatic number and independence number of the conjugate graphs, their line graphs and complement graphs are found. We

APA, Harvard, Vancouver, ISO, and other styles

16

LÁVIČKA, ROMAN, ANTHONY G. O'FARRELL, and IAN SHORT. "Reversible maps in the group of quaternionic Möbius transformations." Mathematical Proceedings of the Cambridge Philosophical Society 143, no. 1 (2007): 57–69. http://dx.doi.org/10.1017/s030500410700028x.

Full text

Abstract:

AbstractThe reversible elements of a group are those elements that are conjugate to their own inverse. A reversible element is said to be reversible by an involution if it is conjugate to its own inverse by an involution. In this paper, we classify the reversible elements and the elements reversible by involutions in the group of quaternionic Möbius transformations.

APA, Harvard, Vancouver, ISO, and other styles

17

CALLAHAN, JASON. "CONJUGATE GENERATORS OF KNOT AND LINK GROUPS." Journal of Knot Theory and Its Ramifications 19, no. 07 (2010): 905–16. http://dx.doi.org/10.1142/s0218216510008248.

Full text

Abstract:

This note establishes a stronger version of a conjecture of Reid and others in the arithmetic case: if two elements of equal trace (e.g. conjugate elements) generate an arithmetic two-bridge knot or link group, then the elements are parabolic (and hence peripheral). This includes the figure-eight knot and Whitehead link groups. Similarly, if two conjugate elements generate the trefoil knot group, then the elements are peripheral.

APA, Harvard, Vancouver, ISO, and other styles

18

Belyaev, V. V. "Groups with finitary classes of conjugate elements." Proceedings of the Steklov Institute of Mathematics 285, S1 (2014): 42–57. http://dx.doi.org/10.1134/s0081543814050058.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Ivanov, A. "Generating sets consisting of pairwise conjugate elements." International Journal of Algebra and Computation 27, no. 01 (2017): 49–60. http://dx.doi.org/10.1142/s0218196717500047.

Full text

Abstract:

We consider groups [Formula: see text] which have generating sets consisting of pairwise conjugate elements. We introduce a natural condition on such sets, namely path-connectedness, which has strong consequences when [Formula: see text] acts on a real tree. The main result of the paper states that the group of type-preserving automorphisms of a regular simplicial tree has a generating set with this property.

APA, Harvard, Vancouver, ISO, and other styles

20

Konieczny, Janusz. "A new definition of conjugacy for semigroups." Journal of Algebra and Its Applications 17, no. 02 (2018): 1850032. http://dx.doi.org/10.1142/s0219498818500329.

Full text

Abstract:

The conjugacy relation plays an important role in group theory. If [Formula: see text] and [Formula: see text] are elements of a group [Formula: see text], [Formula: see text] is conjugate to [Formula: see text] if [Formula: see text] for some [Formula: see text]. The group conjugacy extends to inverse semigroups in a natural way: for [Formula: see text] and [Formula: see text] in an inverse semigroup [Formula: see text], [Formula: see text] is conjugate to [Formula: see text] if [Formula: see text] and [Formula: see text] for some [Formula: see text]. In this paper, we define a conjugacy for

APA, Harvard, Vancouver, ISO, and other styles

21

Durakov, B. E., and A. I. Sozutov. "On Periodic Groups Saturated with Finite Frobenius Groups." Bulletin of Irkutsk State University. Series Mathematics 35 (2021): 73–86. http://dx.doi.org/10.26516/1997-7670.2021.35.73.

Full text

Abstract:

A group is called weakly conjugate biprimitively finite if each its element of prime order generates a finite subgroup with any of its conjugate elements. A binary finite group is a periodic group in which any two elements generate a finite subgroup. If $\mathfrak{X}$ is some set of finite groups, then the group $G$ saturated with groups from the set $\mathfrak{X}$ if any finite subgroup of $G$ is contained in a subgroup of $G$, isomorphic to some group from $\mathfrak{X}$. A group $G = F \leftthreetimes H$ is a Frobenius group with kernel $F$ and a complement $H$ if $H \cap H^f = 1$ for all $

APA, Harvard, Vancouver, ISO, and other styles

22

Jiang, B. N., and G. F. Carey. "Adaptive refinement for least-squares finite elements with element-by-element conjugate gradient solution." International Journal for Numerical Methods in Engineering 24, no. 3 (1987): 569–80. http://dx.doi.org/10.1002/nme.1620240308.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Gutierrez, Edmund, Richard D. Powell, James F. Hainfeld, and Peter M. Takvorian. "A Covalently Linked 10 Nm Gold Immunoprobe." Microscopy and Microanalysis 5, S2 (1999): 1324–25. http://dx.doi.org/10.1017/s1431927600019942.

Full text

Abstract:

Chemically functionalized metal cluster compounds have demonstrated important advantages over colloidal gold as biological microscopy labels. They are covalently cross-linked to the targeting biomolecule, and therefore may be conjugated to a wide range of molecules which cannot be labeled with colloidal gold. The 1.4 nm Nanogold® cluster has been conjugated to peptides, lipids and oligonucleotides, some of which have been proposed as elements of novel molecular wires and novel materials. Dissociation of colloidal gold particles from the conjugate probe, a source of error in quantitative immuno

APA, Harvard, Vancouver, ISO, and other styles

24

Mohd Noor, Alia Husna, Nor Haniza Sarmin, and Hamisan Rahmat. "Related graphs of the conjugacy classes of a 3-generator 5-group." Malaysian Journal of Fundamental and Applied Sciences 14 (October 25, 2018): 454–56. http://dx.doi.org/10.11113/mjfas.v14n0.1269.

Full text

Abstract:

The study on conjugacy class has started since 1968. A conjugacy class is defined as an equivalence class under the equivalence relation of being conjugate. In this research, let be a 3-generator 5-group and the scope of the graphs is a simple undirected graph. This paper focuses on the determination of the conjugacy classes of where the set omega is the subset of all commuting elements in the group. The elements of the group with order 5 are identified from the group presentation. The pair of elements are formed in the form of which is of size two where and commute. In addition, the results o

APA, Harvard, Vancouver, ISO, and other styles

25

AB Hamid, Mohd Halimi. "The Conjugacy Class and Conjugacy Class Graph of Crystallographic Point Groups of Order 12 and Above." Mathematical Sciences and Informatics Journal 2, no. 1 (2021): 1–8. http://dx.doi.org/10.24191/mij.v2i1.12973.

Full text

Abstract:

In chemistry, crystallographic point group is a set of algebraic groups that maintains at least one point in a fixed position while placing certain restrictions on the rotational symmetries. In this research, the application of group theory and graph theory to the symmetry study of a molecule is presented where the conjugacy classes and conjugacy class graphs of crystallographic point groups of order 12 and above are determined. Conjugacy class is a way of classifying the elements of a group such that two elements a and b are conjugate if there exists an element x and given that xax-1=b. The c

APA, Harvard, Vancouver, ISO, and other styles

26

ZYUBIN, S. A. "CONJUGATELY DENSE SUBGROUPS OF 3-DIMENSIONAL LINEAR GROUPS OVER LOCALLY FINITE FIELD." International Journal of Algebra and Computation 15, no. 05n06 (2005): 1273–80. http://dx.doi.org/10.1142/s0218196705002608.

Full text

Abstract:

A subgroup of any group is called conjugately dense if it has nonempty intersection with each class of conjugate elements of the group. The aim of this paper is to prove the following. Let K be a locally finite field and H be an irreducible conjugately dense subgroup of the intermediate group SL 3(K) ≤ G ≤ GL 3(K); then H = G. This result confirms part of P. Neumann's conjecture from problem 6.38 in "Kourovka Notebook" for the group GL 3(K) over locally finite field K.

APA, Harvard, Vancouver, ISO, and other styles

27

Gudivok, P. M., Yu V. Kapitonova, S. S. Polyak, V. P. Rud'ko, and A. I. Tsitkin. "Classes of conjugate elements of the unitriangular group." Cybernetics 26, no. 1 (1990): 47–57. http://dx.doi.org/10.1007/bf01068228.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Demekhov, A. G., J. Manninen, O. Santolík, and E. E. Titova. "Conjugate Ground-Spacecraft Observations of VLF Chorus Elements." Geophysical Research Letters 44, no. 23 (2017): 11,735–11,744. http://dx.doi.org/10.1002/2017gl076139.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Belyi, Konstantin. "CONJUGATE METHOD OF TECHNICAL TRAINING OF KYOKUSHIN ATHLETES." SCIENCE AND SPORT: current trends 8, no. 3 (2020): 13–18. http://dx.doi.org/10.36028/2308-8826-2020-8-3-13-18.

Full text

Abstract:

The aim of the research. Analysis of the ways, forms and methods of applying the conjugate method of technical training of kyokushin athletes. Research methods and organization. Analysis and compilation of the existing scientific and coaching experience in applying the conjugate method in martial arts and kyokushinkai. Research results and discussion. The conjugate method of technical training of a kyokushin athlete should not be limited to conjugation with elements of general or special physical training. It should involve conjugation of technical elements with training exercises of almost al

APA, Harvard, Vancouver, ISO, and other styles

30

MÉTIVIER, YVES, and BRIGITTE ROZOY. "ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS." International Journal of Foundations of Computer Science 02, no. 03 (1991): 257–65. http://dx.doi.org/10.1142/s0129054191000169.

Full text

Abstract:

Let X be a finite set of traces. In this paper we show that each connected iterative factor of X* has a power which may be expressed as the conjugate of a product of the elements of X. From this property we deduce that if the star of a finite set of traces is recognizable then maximal connected factors of iterative factors of X* have a power which is the conjugate of a product of the elements of X.

APA, Harvard, Vancouver, ISO, and other styles

31

Liu, Jen-Yu, and Hong-Sen Yan. "Surface Geometry of Variable Pitch Cylindrical Cams with Conical Meshing Elements." Journal of Mechanical Design 116, no. 3 (1994): 862–66. http://dx.doi.org/10.1115/1.2919461.

Full text

Abstract:

This paper presents mathematical expressions for the surface geometry of variable pitch cylindrical cams with four conical meshing elements based on the theory of conjugate surfaces. The unit normal of the element is derived, with given surface geometry of the meshing element, by differential geometry. The contact lines of the conjugate surface are defined according to the equation of meshing and the specified input-output relation. By the coordinate transformation of contact lines, we have the complete profile of the variable pitch cylindrical cam. The results of this work are instrumental in

APA, Harvard, Vancouver, ISO, and other styles

32

Kalorkoti, K. "A FINITELY PRESENTED GROUP WITH ALMOST SOLVABLE CONJUGACY PROBLEM." Asian-European Journal of Mathematics 02, no. 04 (2009): 611–35. http://dx.doi.org/10.1142/s1793557109000522.

Full text

Abstract:

The algorithmic unsolvability of the conjugacy problem for finitely presented groups was demonstrated by Novikov in the early 1950s. Various simplifications and alternative proofs were found by later researchers and further questions raised. Recent work by Borovik, Myasnikov and Remeslennikov has considered the question of what proportion of the number of elements of a group (obtained by standard constructions) falls into the realm of unsolvability. In this paper we provide a straightforward construction, as a Britton tower, of a finitely presented group with solvable word problem but unsolvab

APA, Harvard, Vancouver, ISO, and other styles

33

Najmuddin, Nabilah, Nor Haniza Sarmin, and Ahmad Erfanian. "The independence polynomial of conjugate graph and noncommuting graph of groups of small order." Malaysian Journal of Fundamental and Applied Sciences 13, no. 4 (2017): 602–5. http://dx.doi.org/10.11113/mjfas.v0n0.709.

Full text

Abstract:

An independent set of a graph is a set of pairwise non-adjacent vertices. The independence polynomial of a graph is defined as a polynomial in which the coefficient is the number of the independent set in the graph. Meanwhile, a graph of a group G is called conjugate graph if the vertices are non-central elements of G and two distinct vertices are adjacent if they are conjugate. The noncommuting graph is defined as a graph whose vertex set is non-central elements in which two vertices are adjacent if and only if they do not commute. In this research, the independence polynomial of the conjugat

APA, Harvard, Vancouver, ISO, and other styles

34

Horbez, Camille, Jingyin Huang, and Adrian Ioana. "Orbit equivalence rigidity of irreducible actions of right-angled Artin groups." Compositio Mathematica 159, no. 4 (2023): 860–87. http://dx.doi.org/10.1112/s0010437x23007054.

Full text

Abstract:

Let $G_\Gamma \curvearrowright X$ and $G_\Lambda \curvearrowright Y$ be two free measure-preserving actions of one-ended right-angled Artin groups with trivial center on standard probability spaces. Assume they are irreducible, i.e. every element from a standard generating set acts ergodically. We prove that if the two actions are stably orbit equivalent (or merely stably $W^*$ -equivalent), then they are automatically conjugate through a group isomorphism between $G_\Gamma$ and $G_\Lambda$ . Through work of Monod and Shalom, we derive a superrigidity statement: if the action $G_\Gamma \curvea

APA, Harvard, Vancouver, ISO, and other styles

35

Rodgers, D. M. "COVERING AND GENERATING THE ALTERNATING GROUP BY CONJUGATE ELEMENTS." Communications in Algebra 29, no. 8 (2001): 3641–46. http://dx.doi.org/10.1081/agb-100105046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Shalev, Aner. "Random Generation of Simple Groups by Two Conjugate Elements." Bulletin of the London Mathematical Society 29, no. 5 (1997): 571–76. http://dx.doi.org/10.1112/s002460939700338x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Makki, Siamak, Zhong Wang, and James R. Leger. "Laser beam relaying with phase-conjugate diffractive optical elements." Applied Optics 36, no. 20 (1997): 4749. http://dx.doi.org/10.1364/ao.36.004749.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Carey, G. F., and B. N. Jiang. "Nonlinear preconditioned conjugate gradient and least-squares finite elements." Computer Methods in Applied Mechanics and Engineering 62, no. 2 (1987): 145–54. http://dx.doi.org/10.1016/0045-7825(87)90020-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Panagopoulos, Dimitrios. "Group elements conjugate to their powers and Bass’ conjecture." Homology, Homotopy and Applications 10, no. 1 (2008): 223–36. http://dx.doi.org/10.4310/hha.2008.v10.n1.a9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Bächle, Andreas, and Benjamin Sambale. "Groups whose elements are not conjugate to their powers." Archiv der Mathematik 110, no. 5 (2018): 447–54. http://dx.doi.org/10.1007/s00013-018-1155-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Cummings, Paul A., and Jamal Teymouri. "On conjugate elements in a semigroup and semigroup diagrams." Semigroup Forum 93, no. 2 (2016): 305–29. http://dx.doi.org/10.1007/s00233-016-9805-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Paul, Somnath. "Conjugate Laplacian eigenvalues of co-neighbour graphs." Algebra and Discrete Mathematics 33, no. 2 (2022): 108–17. http://dx.doi.org/10.12958/adm1754.

Full text

Abstract:

Let G be a simple graph of order n. A vertex subset is called independent if its elements are pairwise non-adjacent. Two vertices in G are co-neighbour vertices if they share the same neighbours. Clearly, if S is a set of pairwise co-neighbour vertices of a graph G, then S is an independent set of G. Let c=a+b√m and c=a−b√m, where a and b are two nonzero integers and m is a positive integer such that m is not a perfect square. In [M. Lepovic, On conjugate adjacency matrices of a graph, Discrete Mathematics, 307, 730-738, 2007], the author defined the matrix Ac(G)=[cij]n to be the conjugate adj

APA, Harvard, Vancouver, ISO, and other styles

43

BRIDSON, MARTIN R., and JAMES HOWIE. "CONJUGACY OF FINITE SUBSETS IN HYPERBOLIC GROUPS." International Journal of Algebra and Computation 15, no. 04 (2005): 725–56. http://dx.doi.org/10.1142/s0218196705002529.

Full text

Abstract:

There is a quadratic-time algorithm that determines conjugacy between finite subsets in any torsion-free hyperbolic group. Moreover, in any k-generator, δ-hyperbolic group Γ, if two finite subsets A and B are conjugate, then x-1 Ax = B for some x ∈ Γ with ǁxǁ less than a linear function of max {ǁγǁ : γ ∈ A ∪ B}. (The coefficients of this linear function depend only on k and δ.) These results have implications for group-based cryptography and the geometry of homotopies in negatively curved spaces. In an appendix, we give examples of finitely presented groups in which the conjugacy problem for e

APA, Harvard, Vancouver, ISO, and other styles

44

Liu, Xin, та Shoufeng Wang. "The transitivity of primary conjugacy in regular ω-semigroups". Open Mathematics 20, № 1 (2022): 1479–508. http://dx.doi.org/10.1515/math-2022-0523.

Full text

Abstract:

Abstract The conjugacy relation plays an important role in group theory and the conjugacy relation of groups has been generalized to semigroups in various methods by several authors. If a a and b b are elements of a semigroup S S , then a a is called primarily conjugate to b b if a = u v a=uv and b = v u b=vu for some u , v ∈ S 1 u,v\in {S}^{1} . In general, primary conjugacy is reflexive and symmetric, but not transitive. Finding the classes of semigroups in which the primary conjugacy is transitive is an open problem raised by Araújo et al. in the literature. In this article, among other thi

APA, Harvard, Vancouver, ISO, and other styles

45

Ho, Shi-Pin, and Yen-Liang Yeh. "THE USE OF ENRICHED HEXAHEDRAL ELEMENTS WITH BUBBLE FUNCTIONS FOR FINITE ELEMENT ANALYSIS." Transactions of the Canadian Society for Mechanical Engineering 30, no. 4 (2006): 495–509. http://dx.doi.org/10.1139/tcsme-2006-0032.

Full text

Abstract:

In this paper, the concept that adds the interior nodes of the Lagrange elements to the serendipity elements is described and a family of enriched elements is presented to improve the accuracy of finite element analysis. By the use of the static condensation technique at the element level, the extra computation time in using these elements can be ignored. Three-dimensional elastic problems are used as examples in this paper. The numerical results show that these enriched elements are more accurate than the traditional serendipity elements. The convergence rate of the enriched elements is the s

APA, Harvard, Vancouver, ISO, and other styles

46

Sozutov, Anatoly, and Mikhail Yanchenko. "On the Existence of f-local Subgroups in a Group with Finite Involution." Bulletin of Irkutsk State University. Series Mathematics 40 (2022): 112–17. http://dx.doi.org/10.26516/1997-7670.2022.40.112.

Full text

Abstract:

An f-local subgroup of an infinite group is each its infinite subgroup with a nontrivial locally finite radical. An involution is said to be finite in a group if it generates a finite subgroup with each conjugate involution. An involution is called isolated if it does not commute with any conjugate involution. We study the group G with a finite non-isolated involution i, which includes infinitely many elements of finite order. It is proved that G has an f-local subgroup containing with i infinitely many elements of finite order. The proof essentially uses the notion of a commuting graph.

APA, Harvard, Vancouver, ISO, and other styles

47

Boileau, Michel, and Erica Flapan. "Uniqueness of Free Actions on S3 Respecting a Knot." Canadian Journal of Mathematics 39, no. 4 (1987): 969–82. http://dx.doi.org/10.4153/cjm-1987-049-3.

Full text

Abstract:

In this paper we consider free actions of finite cyclic groups on the pair (S3, K), where K is a knot in S3. That is, we look at periodic diffeo-morphisms f of (S3, K) such that fn is fixed point free, for all n less than the order of f. Note that such actions are always orientation preserving. We will show that if K is a non-trivial prime knot then, up to conjugacy, (S3, K) has at most one free finite cyclic group action of a given order. In addition, if all of the companions of K are prime, then all of the free periodic diffeo-morphisms of (S3, K) are conjugate to elements of one cyclic grou

APA, Harvard, Vancouver, ISO, and other styles

48

SU, NING, ADOLFO BALLESTER-BOLINCHES, and HANGYANG MENG. "A NOTE ON NORMAL COMPLEMENTS FOR FINITE GROUPS." Bulletin of the Australian Mathematical Society 98, no. 1 (2018): 109–12. http://dx.doi.org/10.1017/s0004972718000151.

Full text

Abstract:

Assume that $G$ is a finite group and $H$ is a 2-nilpotent Sylow tower Hall subgroup of $G$ such that if $x$ and $y$ are $G$-conjugate elements of $H\cap G^{\prime }$ of prime order or order 4, then $x$ and $y$ are $H$-conjugate. We prove that there exists a normal subgroup $N$ of $G$ such that $G=HN$ and $H\cap N=1$.

APA, Harvard, Vancouver, ISO, and other styles

49

Reiner, Victor, Vivien Ripoll, and Christian Stump. "On non-conjugate Coxeter elements in well-generated reflection groups." Mathematische Zeitschrift 285, no. 3-4 (2016): 1041–62. http://dx.doi.org/10.1007/s00209-016-1736-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Iida, H., and Y. Shibata. "Delivery of lectin-labeled membrane to the trans-Golgi network and secretory granules in cultured atrial myocytes." Journal of Histochemistry & Cytochemistry 37, no. 12 (1989): 1885–92. http://dx.doi.org/10.1177/37.12.2479675.

Full text

Abstract:

To examine whether and how internalized plasma membrane components are routed to the compartment of the biosynthetic-exocytic pathway in cultured atrial myocytes, the plasma membrane labeled with wheat germ agglutinin conjugated to horseradish peroxidase (WGA-HRP) was traced electron microscopically by cytochemical detection of HRP. The WGA-HRP label was internalized via a coated pit-small vesicle pathway and reached vacuoles and endosomes by 3 min. Labeled endosomes comprised vacuoles and tubular elements containing reaction product. By 15 min, similar tubular structures containing reaction p

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!