Reflection groups on Riemannian manifolds

We investigate discrete groups G of isometries of a complete connected Riemannian manifold M which are generated by reflections, in particular those generated by disecting reflections. We show that these are Coxeter groups, and that the orbit space M/G is isometric to a Weyl chamber C which is a Riemannian manifold with corners and certain angle conditions along intersections of faces. We can also reconstruct the manifold and its action from the Riemannian chamber and its equipment of isotropy group data along the faces. We also discuss these results from the point of view of Riemannian orbifolds. Mathematics Subject Classification Primary 51F15, 53C20, 20F55, 22E40     

Complexity theory and collaboration: An agent-based simulator for a space mission design team

In this paper, we investigate how complexity theory can benefit collaboration by applying an agent-based computer simulation approach to a new form of synchronous real-time collaborative engineering design. Fieldwork was conducted with a space mission design team during their actual design sessions, to collect data on their group conversations, team interdependencies, and error monitoring and recovery practices. Based on the fieldwork analysis, an agent-based simulator was constructed. The simulation shows how error recovery and monitoring is affected by the number of small group, or sidebar, conversations, and consequent noise in the room environment. This simulation shows that it is possible to create a virtual environment with cooperating agents interacting in a dynamic environment. This simulation approach is useful for identifying the best scenarios and eliminating potential catastrophic combinations of parameters and values, where error recovery and workload in collaborative engineering design could be significantly impacted. This approach is also useful for defining strategies for integrating solutions into organizations. Narjès Bellamine-Ben Saoud is an Associate Professor at the University of Tunis and Researcher at RIADI-GDL Laboratory, Tunisia. After Computer Science engineering diploma (1993) of the ENSEEIHT of Toulouse, France, she received her PhD (1996), on groupware design applied to the study of cooperation within a space project, from the University of Toulouse I, France. Her main research interests concern studying complex systems particularly by modeling and simulating collaborative and socio-technical systems; developing Computer Supported Collaborative Learning in tunisian primary schools; and Software Engineering. Her current reserach projects include modeling and simulation of emergency rescue activities for large-scale accidents, modeling of epidemics and study of malaria, simulation of collabration artifacts. Gloria Mark is an Associate Professor in the Department of Informatics, University of California, Irvine. Dr. Mark received her Ph.D. in Psychology from Columbia University in 1991. Prior to UCI, she was a Research Scientist at the GMD, in Bonn, Germany, a visiting research scientist at the Boeing Company, and a research scientist at the Electronic Data Systems Center for Advanced Research. Dr. Mark’s research focuses on the design and evaluation of collaborative systems. Her current projects include studying worklife in the network-centric organization, multi-tasking of information workers, nomad workers, and a work in a large-scale medical collaboratory. Dr. Mark is widely published in the fields of CSCW and HCI, is currently the program co-chair for the ACM CSCW’06 conference and is on the editorial board of Computer Supported Cooperative Work: The Journal of Collaborative Computing, and e-Service Qu@rterly.     

Character degree graphs that are complete graphs

Let be a finite group, and write for the set of degrees of irreducible characters of . We define to be the graph whose vertex set is , and there is an edge between and if . We prove that if is a complete graph, then is a solvable group.

     

Randomized UMD Banach spaces and decoupling inequalities for stochastic integrals

In this paper we prove the equivalence of decoupling inequalities for stochastic integrals and one-sided randomized versions of the UMD property of a Banach space as introduced by Garling.

     

Symmetric edge-decompositions of hypercubes

We call a set of edgesE of the n-cubeQ _n a fundamental set for Q _n if for some subgroupG of the automorphism group ofQ _n , theG-translates ofE partition the edge set ofQ _n .Q _n possesses an abundance of fundamental sets. For example, a corollary of one of our main results is that if |E| =n and the subgraph induced byE is connected, then if no three edges ofE are mutually parallel,E is a fundamental set forQ _n . The subgroupG is constructed explicitly. A connected graph onn edges can be embedded intoQ _n so that the image of its edges forms such a fundamental set if and only if each of its edges belongs to at most one cycle.We also establish a necessary condition forE to be a fundamental set. This involves a number-theoretic condition on the integersa _j (E), where for 1 j n, a _j (E) is the number of edges ofE in thej ^th direction (i.e. parallel to thej ^th coordinate axis).     

On the Kadomtsev-Petviashvili Equation and Associated Constraints

The initial-boundary-value problem for the Kadomtsev-Petviashvili equation in infinite space is considered. When formulated as an evolution equation, found that a symmetric integral is the appropriate choice in the nonlocal term; namely, . If one simply chooses , then an infinite number of constraints on the initial data in physical space are required, the first being . The conserved quantities are calculated, and it is shown that they must be suitably regularized from those that have been used when the constraints are imposed.     

The mean curvature of the influence surface of wave equation with sources on a moving surface

The mean curvature of the influence surface of the space–time point ( x , t) appears in linear supersonic propeller noise theory and in the Kirchhoff formula for a supersonic surface. Both these problems are governed by the linear wave equation with sources on a moving surface. The influence surface is also called the Σ‐surface in the aeroacoustic literature. This surface is the locus, in a frame fixed to the quiescent medium, of all the points of a radiating surface f( x , t)=0 whose acoustic signals arrive simultaneously to an observer at position x and at the time t. Mathematically, the Σ‐surface is produced by the intersection of the characteristic conoid of the space–time point ( x , t) and the moving surface. In this paper, we derive the expression for the local mean curvature of the Σ‐surface of the space–time point ( x , t) for a moving rigid or deformable surface f( x , t)=0. This expression is a complicated function of the geometric and kinematic parameters of the surface f( x , t)=0. Using the results of this paper, the solution of the governing wave equation of high‐speed propeller noise radiation as well as the Kirchhoff formula for a supersonic surface can be written as very compact analytic expressions. Copyright © 1999 John Wiley & Sons, Ltd.     

Robust sparse phase retrieval made easy

In this short note we propose a simple two-stage sparse phase retrieval strategy that uses a near-optimal number of measurements, and is both computationally efficient and robust to measurement noise. In addition, the proposed strategy is fairly general, allowing for a large number of new measurement constructions and recovery algorithms to be designed with minimal effort.     

Analysis of Iterative Sub-structuring Techniques for Boundary Element Approximation of the Hypersingular Operator in Three Dimensions

The article deals with the analysis of Additive Schwarz preconditioners for the h -version of the boundary element method for the hypersingular integral equation on surfaces in three dimensions. The first preconditioner consists of decomposing into local spaces associated with the subdomain interiors, supplemented with a wirebasket space associated with the subdomain interfaces. The wirebasket correction only involves the inversion of a diagonal matrix, while the interior correction consists of inverting the sub-blocks of the stiffness matrix corresponding to the interior degrees of freedom on each subdomain. It is shown that the condition number of the preconditioned system grows at most as max K H m 1 (1 + log H / h K ) 2 where H is the size of the quasi-uniform subdomains and h K is the size of the elements in subdomain K . A second preconditioner is given that incorporates a coarse space associated with the subdomains. This improves the robustness of the method with respect to the number of subdomains: theoretical analysis shows that growth of the condition number of the preconditioned system is now bounded by max K (1 + log H / h K ) 2 .