• 제목/요약/키워드: solvable groups

검색결과 29건 처리시간 0.02초

LEFT-INVARIANT MINIMAL UNIT VECTOR FIELDS ON THE SEMI-DIRECT PRODUCT Rn

  • Yi, Seung-Hun
    • 대한수학회보
    • /
    • 제47권5호
    • /
    • pp.951-960
    • /
    • 2010
  • We provide the set of left-invariant minimal unit vector fields on the semi-direct product $\mathbb{R}^n\;{\rtimes}_p\mathbb{R}$, where P is a nonsingular diagonal matrix and on the 7 classes of 4-dimensional solvable Lie groups of the form $\mathbb{R}^3\;{\rtimes}_p\mathbb{R}$ which are unimodular and of type (R).

INFRA-SOLVMANIFOLDS OF Sol14

  • LEE, KYUNG BAI;THUONG, SCOTT
    • 대한수학회지
    • /
    • 제52권6호
    • /
    • pp.1209-1251
    • /
    • 2015
  • The purpose of this paper is to classify all compact manifolds modeled on the 4-dimensional solvable Lie group $Sol_1^4$, and more generally, the crystallographic groups of $Sol_1^4$. The maximal compact subgroup of Isom($Sol_1^4$) is $D_4={\mathbb{Z}}_4{\rtimes}{\mathbb{Z}}_2$. We shall exhibit an infra-solvmanifold of $Sol_1^4$ whose holonomy is $D_4$. This implies that all possible holonomy groups do occur; the trivial group, ${\mathbb{Z}}_2$ (5 families), ${\mathbb{Z}}_4$, ${\mathbb{Z}}_2{\times}{\mathbb{Z}}_2$ (5 families), and ${\mathbb{Z}}_4{\rtimes}{\mathbb{Z}}_2$ (2 families).

ON FINITE GROUPS WITH A CERTAIN NUMBER OF CENTRALIZERS

  • REZA ASHRAFI ALI;TAERI BIJAN
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.217-227
    • /
    • 2005
  • Let G be a finite group and $\#$Cent(G) denote the number of centralizers of its elements. G is called n-centralizer if $\#$Cent(G) = n, and primitive n-centralizer if $\#$Cent(G) = $\#$Cent($\frac{G}{Z(G)}$) = n. In this paper we investigate the structure of finite groups with at most 21 element centralizers. We prove that such a group is solvable and if G is a finite group such that G/Z(G)$\simeq$$A_5$, then $\#$Cent(G) = 22 or 32. Moreover, we prove that As is the only finite simple group with 22 centralizers. Therefore we obtain a characterization of As in terms of the number of centralizers

On the Mordell-Weil Groups of Jacobians of Hyperelliptic Curves over Certain Elementary Abelian 2-extensions

  • Moon, Hyun-Suk
    • Kyungpook Mathematical Journal
    • /
    • 제49권3호
    • /
    • pp.419-424
    • /
    • 2009
  • Let J be the Jacobian variety of a hyperelliptic curve over $\mathbb{Q}$. Let M be the field generated by all square roots of rational integers over a finite number field K. Then we prove that the Mordell-Weil group J(M) is the direct sum of a finite torsion group and a free $\mathbb{Z}$-module of infinite rank. In particular, J(M) is not a divisible group. On the other hand, if $\widetilde{M}$ is an extension of M which contains all the torsion points of J over $\widetilde{\mathbb{Q}}$, then $J(\widetilde{M}^{sol})/J(\widetilde{M}^{sol})_{tors}$ is a divisible group of infinite rank, where $\widetilde{M}^{sol}$ is the maximal solvable extension of $\widetilde{M}$.

FINITE NON-NILPOTENT GENERALIZATIONS OF HAMILTONIAN GROUPS

  • Shen, Zhencai;Shi, Wujie;Zhang, Jinshan
    • 대한수학회보
    • /
    • 제48권6호
    • /
    • pp.1147-1155
    • /
    • 2011
  • In J. Korean Math. Soc, Zhang, Xu and other authors investigated the following problem: what is the structure of finite groups which have many normal subgroups? In this paper, we shall study this question in a more general way. For a finite group G, we define the subgroup $\mathcal{A}(G)$ to be intersection of the normalizers of all non-cyclic subgroups of G. Set $\mathcal{A}_0=1$. Define $\mathcal{A}_{i+1}(G)/\mathcal{A}_i(G)=\mathcal{A}(G/\mathcal{A}_i(G))$ for $i{\geq}1$. By $\mathcal{A}_{\infty}(G)$ denote the terminal term of the ascending series. It is proved that if $G=\mathcal{A}_{\infty}(G)$, then the derived subgroup G' is nilpotent. Furthermore, if all elements of prime order or order 4 of G are in $\mathcal{A}(G)$, then G' is also nilpotent.

An Upper Bound for the Probability of Generating a Finite Nilpotent Group

  • Halimeh Madadi;Seyyed Majid Jafarian Amiri;Hojjat Rostami
    • Kyungpook Mathematical Journal
    • /
    • 제63권2호
    • /
    • pp.167-173
    • /
    • 2023
  • Let G be a finite group and let ν(G) be the probability that two randomly selected elements of G produce a nilpotent group. In this article we show that for every positive integer n > 0, there is a finite group G such that ${\nu}(G)={\frac{1}{n}}$. We also classify all groups G with ${\nu}(G)={\frac{1}{2}}$. Further, we prove that if G is a solvable nonnilpotent group of even order, then ${\nu}(G){\leq}{\frac{p+3}{4p}}$, where p is the smallest odd prime divisor of |G|, and that equality exists if and only if $\frac{G}{Z_{\infty}(G)}$ is isomorphic to the dihedral group of order 2p where Z(G) is the hypercenter of G. Finally we find an upper bound for ν(G) in terms of |G| where G ranges over all groups of odd square-free order.

PSEUDO-RIEMANNIAN SASAKI SOLVMANIFOLDS

  • Diego Conti;Federico A. Rossi;Romeo Segnan Dalmasso
    • 대한수학회지
    • /
    • 제60권1호
    • /
    • pp.115-141
    • /
    • 2023
  • We study a class of left-invariant pseudo-Riemannian Sasaki metrics on solvable Lie groups, which can be characterized by the property that the zero level set of the moment map relative to the action of some one-parameter subgroup {exp tX} is a normal nilpotent subgroup commuting with {exp tX}, and X is not lightlike. We characterize this geometry in terms of the Sasaki reduction and its pseudo-Kähler quotient under the action generated by the Reeb vector field. We classify pseudo-Riemannian Sasaki solvmanifolds of this type in dimension 5 and those of dimension 7 whose Kähler reduction in the above sense is abelian.

Knowledge Assisted Pricing Advisor for Large-scale Retailers: KAPA

  • Sung, Nahk-Hyun;Lee, Jae-Kyu
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 1998년도 추계학술대회 논문집
    • /
    • pp.36-39
    • /
    • 1998
  • It is very difficult for the large-scale retailers, who deal with tens of thousands of items, to price all the items dynamically reflecting all the constraints and policies. In spite of its importance, the prices are determined by human experts because the process of setting the prices of all the items is not established yet. To solve this problem, we adopt a mixed model that combines three typical pricing models: cost-plus model, competition-oriented model, and demand-oriented model. Since each model an be converted to a set of constraints in point and interval forms, solving the pricing problem with the three groups of models requires an algorithm which can solve the problem with weighted constraints of intervals and points. So we have devised an algorithm named “Point Determination Algorithm”. From the rules that represents tile models, the constraints are extracted to be solvable by tile Point Determination Algorithm. A prototype KAPA (Knowledge Assisted pricing Advisor) is developed with this idea using the expert system environment UNIK - a tool developed by KAIST. According to the experiment with 76 items in comparison with 53 human pricing experts we confirmed that the KAPA can perform highly consistent with human experts. This implies KAPA system is applicable to pricing millions of items dynamically.

  • PDF

Optimization of structural and mechanical engineering problems using the enriched ViS-BLAST method

  • Dizangian, Babak;Ghasemi, Mohammad Reza
    • Structural Engineering and Mechanics
    • /
    • 제77권5호
    • /
    • pp.613-626
    • /
    • 2021
  • In this paper, an enhanced Violation-based Sensitivity analysis and Border-Line Adaptive Sliding Technique (ViS-BLAST) will be utilized for optimization of some well-known structural and mechanical engineering problems. ViS-BLAST has already been introduced by the authors for solving truss optimization problems. For those problems, this method showed a satisfactory enactment both in speed and efficiency. The Enriched ViS-BLAST or EVB is introduced to be vastly applicable to any solvable constrained optimization problem without any specific initialization. It uses one-directional step-wise searching technique and mostly limits exploration to the vicinity of FNF border and does not explore the entire design space. It first enters the feasible region very quickly and keeps the feasibility of solutions. For doing this important, EVB groups variables for specifying the desired searching directions in order to moving toward best solutions out or inside feasible domains. EVB was employed for solving seven numerical engineering design problems. Results show that for problems with tiny or even complex feasible regions with a larger number of highly non-linear constraints, EVB has a better performance compared to some records in the literature. This dominance was evaluated in terms of the feasibility of solutions, the quality of optimum objective values found and the total number of function evaluations performed.