Search results for "Order theory"
showing 10 items of 150 documents
On a paper of Beltrán and Shao about coprime action
2020
Abstract Assume that A and G are finite groups of coprime orders such that A acts on G via automorphisms. Let p be a prime. The following coprime action version of a well-known theorem of Ito about the structure of a minimal non-p-nilpotent groups is proved: if every maximal A-invariant subgroup of G is p-nilpotent, then G is p-soluble. If, moreover, G is not p-nilpotent, then G must be soluble. Some earlier results about coprime action are consequences of this theorem.
Products of groups and group classes
1994
Letχ be a Schunck class, and let the finite groupG=AB=BC=AC be the product of two nilpotent subgroupsA andB andχ-subgroupC. If for every common prime divisorp of the orders ofA andB the cyclic group of orderp is anχ-group, thenG is anχ-group. This generalizes earlier results of O. Kegel and F. Peterson. Some related results for groups of the formG=AB=AK=BK, whereK is a nilpotent normal subgroup ofG andA andB areχ-groups for some saturated formationχ, are also proved.
SOME SPECTRAL PROPERTIES OF MULTIPLIERS ON SEMI-PRIME BANACH ALGEBRAS
1995
Abstract We extend to arbitrary semi-prime Banach algebras some results of spectral theory and Fredholm theory obtained in [1] and [2] for multipliers defined in commutative semi-simple Banach algebras.
Recent Advances in Bayesian Inference in Cosmology and Astroparticle Physics Thanks to the MultiNest Algorithm
2012
We present a new algorithm, called MultiNest, which is a highly efficient alternative to traditional Markov Chain Monte Carlo (MCMC) sampling of posterior distributions. MultiNest is more efficient than MCMC, can deal with highly multi-modal likelihoods and returns the Bayesian evidence (or model likelihood, the prime quantity for Bayesian model comparison) together with posterior samples. It can thus be used as an all-around Bayesian inference engine. When appropriately tuned, it also provides an exploration of the profile likelihood that is competitive with what can be obtained with dedicated algorithms.
Exacus: Efficient and Exact Algorithms for Curves and Surfaces
2005
We present the first release of the Exacus C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.
La Psicologga Financiera Y La Estructura De Capital De Las Pymes (The Financial Psychology and SME's Capital Structure)
2015
Spanish Abstract: El objetivo de este trabajo es estudiar las Teorias de la Estructura de Capital para detectar aquellas variables que pueden determinar el nivel de endeudamiento elegido por una empresa. Para ello se examina la naturaleza y dificultades financieras de las pymes, y se realiza una comparativa con la piramide de Maslow para mostrar la vertiente psicologica de la estructura de capital de las companias. Estos argumentos posteriormente son contrastados con un analisis empirico de las pymes de la Comunidad Valenciana, complementado con varias entrevistas a pymes valencianas para conocer la opinion y experiencia de las personas mas cercanas a estas. Entre otras cosas, se concluye q…
TRADE-OFF THEORY VS. PECKING ORDER THEORY – EMPIRICAL EVIDENCE FROM THE BALTIC COUNTRIES
2014
Capital structure is of particular importance in estimating the company value; an accurately estimated and selected equity and debt ratio can maximize the company value and minimizes the cost of capital; therefore, this issue is especially significant in the changing conditions of economic development. The main purpose of this study is to simultaneously evaluate the pecking order and trade-off theories of capital structure and determine which one performs better for a sample of companies from the Baltic states. Analysis is conducted on a sample of 75 listed companies (Baltic Stock Exchange) over the period from 1998 to 2011. The authors test theories using panel data and regression analysis…
Complex powers and non-compact manifolds
2002
We study the complex powers $A^{z}$ of an elliptic, strictly positive pseudodifferential operator $A$ using an axiomatic method that combines the approaches of Guillemin and Seeley. In particular, we introduce a class of algebras, ``extended Weyl algebras,'' whose definition was inspired by Guillemin's paper on the subject. An extended Weyl algebra can be thought of as an algebra of ``abstract pseudodifferential operators.'' Many algebras of pseudodifferential operators are extended Weyl algebras. Several results typical for algebras of pseudodifferential operators (asymptotic completeness, construction of Sobolev spaces, boundedness between apropriate Sobolev spaces, >...) generalize to…
Primitive subgroups and PST-groups
2014
AbstractAll groups considered in this paper are finite. A subgroup $H$ of a group $G$ is called a primitive subgroup if it is a proper subgroup in the intersection of all subgroups of $G$ containing $H$ as a proper subgroup. He et al. [‘A note on primitive subgroups of finite groups’, Commun. Korean Math. Soc. 28(1) (2013), 55–62] proved that every primitive subgroup of $G$ has index a power of a prime if and only if $G/ \Phi (G)$ is a solvable PST-group. Let $\mathfrak{X}$ denote the class of groups $G$ all of whose primitive subgroups have prime power index. It is established here that a group $G$ is a solvable PST-group if and only if every subgroup of $G$ is an $\mathfrak{X}$-group.