Search results for "Abstract algebra"
showing 10 items of 452 documents
Positive definite functions of finitary isometry groups over fields of odd characteristic
2007
Abstract This paper is part of a programme to describe the lattice of all two-sided ideals in complex group algebras of simple locally finite groups. Here we determine the extremal normalized positive definite functions for finitary groups of isometries, defined over fields of odd characteristic.
On the regularity of the partial {$O\sp *$}-algebras generated by a closed symmetric operator
1992
Let be given a dense domain D in a Hilbert space and a closed symmetric operator T with domain containing D. Then the restriction of T to D generates (algebraically) two partial *-algebras of closable operators (called weak and strong), possibly nonabelian and nonassociative. We characterize them completely. In particular, we examine under what conditions they are regular, that is, consist of polynomials only, and standard. Simple differential operators provide concrete examples of all the pathologies allowed by the abstract theory.
Identities of *-superalgebras and almost polynomial growth
2015
We study the growth of the codimensions of a *-superalgebra over a field of characteristic zero. We classify the ideals of identities of finite dimensional algebras whose corresponding codimensions are of almost polynomial growth. It turns out that these are the ideals of identities of two algebras with distinct involutions and gradings. Along the way, we also classify the finite dimensional simple *-superalgebras over an algebraically closed field of characteristic zero.
A simple algorithm for generating neuronal dendritic trees
1990
Abstract A simple, efficient algorithm is presented for generating the codewords of all neuronal dendritic trees with a given number of terminal nodes. Furthermore, a procedure is developed for deciding if different codewords correspond to topologically equivalent trees.
A general metric regularity in asplund banach spaces
1998
This paper establishes a simple and easily-applied criterion for determining whether a multivalued mapping is metrically regular relatively to a subset in the range space.
High Order in Space and Time Schemes Through an Approximate Lax-Wendroff Procedure
2017
This paper deals with the scheme proposed by the authors in Zorio, Baeza and Mulet (J Sci Comput 71(1):246–273, 2017). This scheme is an alternative to the techniques proposed in Qiu and Shu (SIAM J Sci Comput 24(6):2185–2198, 2003) to obtain high-order accurate schemes using Weighted Essentially Non Oscillatory finite differences and approximating the flux derivatives required by the Cauchy-Kovalevskaya procedure by simple centered finite differences. We analyse how errors in first-order terms near discontinuities propagate through both versions of the Cauchy-Kovalevskaya procedure. We propose a fluctuation control, for which the approximation of the first-order derivative to be used in th…
A general procedure for the construction of Gorges polygons for multi-phase windings of electrical machines
2018
This paper presents a simple and effective procedure for the determination of the Gorges polygon, suitable for all possible winding configurations in electrical machines. This methodology takes into account the determination of a Winding Distribution Table (WDT), in which all the information about the distribution of the currents along the stator periphery is computed and from which the Görges polygon are easily derived. The proposed method can be applied to both symmetrical and asymmetrical multi-phase windings, including concentrated, fractional, reduced and dead-coil ones. The examples provided in this paper demonstrate the versatility of the proposed method.
Matching factorization theorems with an inverse-error weighting
2018
We propose a new fast method to match factorization theorems applicable in different kinematical regions, such as the transverse-momentum-dependent and the collinear factorization theorems in Quantum Chromodynamics. At variance with well-known approaches relying on their simple addition and subsequent subtraction of double-counted contributions, ours simply builds on their weighting using the theory uncertainties deduced from the factorization theorems themselves. This allows us to estimate the unknown complete matched cross section from an inverse-error-weighted average. The method is simple and provides an evaluation of the theoretical uncertainty of the matched cross section associated w…
Massive evaluation and analysis of Poincar�� recurrences on grids of initial data: a tool to map chaotic diffusion
2020
We present a novel numerical method aimed to characterize global behaviour, in particular chaotic diffusion, in dynamical systems. It is based on an analysis of the Poincar\'e recurrence statistics on massive grids of initial data or values of parameters. We concentrate on Hamiltonian systems, featuring the method separately for the cases of bounded and non-bounded phase spaces. The embodiments of the method in each of the cases are specific. We compare the performances of the proposed Poincar\'e recurrence method (PRM) and the custom Lyapunov exponent (LE) methods and show that they expose the global dynamics almost identically. However, a major advantage of the new method over the known g…
Belief elicitation with multiple point predictions
2021
Abstract We propose a simple, incentive compatible procedure based on binarized linear scoring rules to elicit beliefs about real-valued outcomes - multiple point predictions. Simultaneously eliciting multiple point predictions with linear incentives reveals the subjective probability distribution without pre-defined intervals or probabilistic statements. We show that the approach is theoretically as robust as existing methods, while adapting flexibly to different beliefs. In a laboratory experiment, we compare our procedure to the standard approach of eliciting discrete probabilities on pre-defined intervals. We find that elicitation with multiple point predictions is faster, perceived as …