Sharif Digital Repository

Given a non-commutative finite dimensional F-central division algebra D, we study conditions under which every non-abelian maximal subgroup M of GL n(D) contains a non-cyclic free subgroup. In general, it is shown that either M contains a non-cyclic free subgroup or there exists a unique maximal subfield K of Mn(D) such that NGLn<(D) (K*)=M, K* M, K/F is Galois with Gal(K/F) ≅ M/K*, and F[M]=Mn(D). In particular, when F is global or local, it is proved that if ([D:F],Char(F))=1, then every non-abelian maximal subgroup of GL 1(D) contains a non-cyclic free subgroup. Furthermore, it is also shown that GLn(F) contains no solvable maximal subgroups provided that F is local or global and n ≥ 5. ©... 

Given an F-central simple algebra A = M n(D), denote by A′ the derived group of its unit group A*. Here, the Frattini subgroup Φ(A*) of A* for various fields F is investigated. For global fields, it is proved that when F is a real global field, then Φ(A*) = Φ(F*)Z(A′), otherwise Φ(A*) = ∩ pdoes not dividedeg(A) F *p. Furthermore, it is also shown that Φ(A*) = k* whenever F is either a field of rational functions over a divisible field k or a finitely generated extension of an algebraically closed field k  

This is a variation on a theme of Bayer-Fluckiger, Shapiro, and Tignol related to hyperbolic involutions. More precisely, criteria for the hyperbolicity of involutions of quadratic extensions of simple algebras and involutions of the form σ ⊗ τ and σ ⊗ ρ, where σ is an involution of a central simple algebra A, τ is the nontrivial automorphism of a quadratic extension of the center of A, and ρ is an involution of a quaternion algebra are obtained  

In this paper we consider maintaining the visibility of a segment observer moving inside a simple polygon. A practical instance of this problem is to identify the regions of a planar scene illuminated by a fluorescent lamp while the lamp moves around. We consider both strong and weak visibility in this paper. Our method is based on the shortest path tree which builds a linear-sized data structure in O(n) time, where n is the number of the vertices of the underlying simple polygon P. We first compute VP(st̄), the initial view of the segment observer st̄. Then, as st̄ moves, each change of VP(st̄) can be computed in O(log2(|V P(st̄)|)) time when the observer is allowed to change its direction,... 

In Spatial Voting Theory, distortion is a measure of how good the winner is. It has been proved that no deterministic voting mechanism can guarantee a distortion better than 3, even for simple metrics such as a line. In this study, we wish to answer the following question: How does the distortion value change if we allow less motivated agents to abstain from the election? We consider an election with two candidates and suggest an abstention model, which is a general form of the abstention model proposed by Kirchgässner. Our results characterize the distortion value and provide a rather complete picture of the model. ©2021 AI Access Foundation  

In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or (Formula presented.)) inside a given polygon (Formula presented.). Our first algorithm runs in simple polygons and needs (Formula presented.) time and (Formula presented.) space in the preprocessing phase to report (Formula presented.) of any query line segment pq in time (Formula presented.). We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with (Formula presented.) pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs (Formula presented.) time and (Formula presented.) space in the... 

In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or WVP(pq)) inside a given polygon P. Our first algorithm runs in simple polygons and needs O(n3 log n) time and O(n3) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|).. We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with h ≥ 1 pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs O(n2 log n) time and O(n2) space in the preprocessing phase and WVP(pq) in query time of O(nh’ log n + k), in which h’ is an output sensitive parameter... 

In this paper, we consider the problem of computing the weak visibility (WV ) of a query line segment in- side a simple polygon. Our algorithm first preprocesses the polygon and creates data structures from which any WV query is answered efficiently in an output sensitive manner. In our solution, the preprocessing is performed in time O(n3 log n) and the size of the constructed data structure is O(n3). It is then possible to report the WV polygon of any query line segment in time O(log n+k), where k is the size of the output. Our algorithm im- proves the current results for this problem  

A necessary and sufficient condition for a central simple algebra with involution over a field of characteristic two to be decomposable as a tensor product of quaternion algebras with involution, in terms of its Frobenius subalgebras, is given. It is also proved that a bilinear Pfister form, recently introduced by A. Dolphin, can classify totally decomposable central simple algebras of orthogonal type  

Given a simple polygon P with n vertices, the visibility polygon (V P) of a point q (V P(q)), or a segment (formula present) (V P(pq)) inside P can be computed in linear time. We propose a linear time algorithm to extend V P of a viewer (point or segment), by converting some edges of P into mirrors, such that a given non-visible segment (formula present) can also be seen from the viewer. Various definitions for the visibility of a segment, such as weak, strong, or complete visibility are considered. Our algorithm finds every edge such that, when converted to a mirror, makes (formula present) visible to our viewer. We find out exactly which interval of (formula present) becomes visible, by... 

Let D be a division ring with center F and n {greater than or slanted equal to} 1 a natural number. For S ⊆ Mn(D) the commuting graph of S, denoted by Γ(S), is the graph with vertex set S{minus 45 degree rule}Z(S) such that distinct vertices a and b are adjacent if and only if ab = ba. In this paper we prove that if n > 2 and A, N, I, T are the sets of all non-invertible, nilpotent, idempotent matrices, and involutions, respectively, then for any division ring D, Γ ( A ), Γ ( N ), Γ ( I ), and Γ ( T ) are connected graphs. We show that if n > 2 and U is the set of all upper triangular matrices, then for every algebraic division ring D, Γ ( U ) is a connected graph. Also it is shown that if R... 

In this paper we study and analyze multiple-shift algorithms in the context of ultrawideband radio frame time-hopping CDMA system (UWB-FTH-CDMA). In our analysis we consider major sources of noise, namely multiaccess interference and the additive white Gaussian noise. For multiaccess interference we consider a model in which mutual interference due to each user is based on frame asynchronous but half-chip synchronous. Since simple serial-search is a special case of the multiple-shift algorithm, we can analyze the advantage of multiple-shift algorithm. It is shown that multiple-shift algorithm is superior than simple serial-search algorithm in reducing the required average acquisition time by... 

AI planning is one of the research fields that has benefited from employing satisfiability checking methods. These methods have been proved to be very effective in finding optimal plans for both classical and temporal planning. It is also known that by using planning-based heuristic information in solving SAT formulae, one can develop SAT-based planners that are competitive with state-of-the-art non-optimal planners in classical planning domains. However, using satisfiability for non-optimal temporal planning has not been investigated so far. The main difficulty in using satisfiability in temporal planning is the representation of time, which is a continuous concept. Previously introduced... 

In this paper, the nonlinear oscillation of a pendulum wrapping and unwrapping on two cylindrical bases is studied, and an analytical solution is obtained using the multiple scales method. The equation of motion is derived based on an energy conservation technique. By applying the perturbation method to the differential equation, the nonlinear natural frequency of the system is calculated, along with its time response. Analytical results are compared with numerical findings and good agreement is found. The effect of large amplitude and radius of cylinders on system frequency is evaluated. The results indicate that as the radius of the cylinder increases, the system frequency is increased.... 

Since that heuristic state space planners have been very successful in classical planning, this approach is currently the most popular strategy in dealing with temporal planning, too. However, all current state-space temporal planners use a search method known as decision epoch planning, which is not complete for problems with required concurrency. In theory, this flaw can be overcome by employing another search method, called temporally lifted progression planning. In this paper, we show that there are two major problems which, if not tackled properly, can cause the latter method to be very inefficient in practice. The first problem is dealing with the remarkably large state space of... 

In the Touring Polygons Problem (TPP) there is a start point s, a sequence of simple polygons P=(P1,. . .,Pk) and a target point t in the plane. The goal is to obtain a path of minimum possible length that starts from s, visits in order each of the polygons in P and ends at t. This problem was introduced by Dror, Efrat, Lubiw and Mitchell in STOC '03. They proposed a polynomial time algorithm for the problem when the polygons in P are convex and proved its NP-hardness for intersecting and non-convex polygons. They asked as an open problem whether TPP is NP-hard when the polygons are pairwise disjoint. In this paper, we prove that TPP is also NP-hard when the polygons are pairwise disjoint in...