Search results for "init"
showing 10 items of 6629 documents
Doubly nonlinear equations with unbounded operators
2004
Abstract The solvability of the evolution system v′(t)+ B (t)u(t)∋ f (t),v(t)∈ A (t)u(t) , 0 A (t) are bounded, possibly degenerate, subdifferentials and B (t) are unbounded subdifferentials.
A variation on theorems of Jordan and Gluck
2006
Abstract Gluck proved that any finite group G has an abelian subgroup A such that | G : A | is bounded by a polynomial function of the largest degree of the complex irreducible characters of G . This improved on a previous bound of Isaacs and Passman. In this paper, we present a variation of this result that looks at the number of prime factors. All these results, in turn, may be seen as variations on the classical theorem of Jordan on linear groups.
Asymptotics for the multiplicities in the cocharacters of some PI-algebras
2003
We consider associative PI-algebras over a field of characteristic zero. We study the asymptotic behavior of the sequence of multiplicities of the cocharacters for some significant classes of algebras. We also give a characterization of finitely generated algebras for which this behavior is linear or quadratic.
A generalization of Sardinas and Patterson's algorithm to z-codes
1993
Abstract This paper concerns the framework of z-codes theory. The main contribution consists in an extension of the algorithm of Sardinas and Patterson for deciding whether a finite set of words X is a z-code. To improve the efficiency of this test we have found a tight upper bound on the length of the shortest words that might have a double z-factorization over X. Some remarks on the complexity of the algorithm are also given. Moreover, a slight modification of this algorithm allows us to compute the z-deciphering delay of X.
On the Navarro–Willems conjecture for blocks of finite groups
2007
Abstract We prove that a set of characters of a finite group can only be the set of characters for principal blocks of the group at two different primes when the primes do not divide the group order. This confirms a conjecture of Navarro and Willems in the case of principal blocks.
On 𝓕-subnormal subgroups and Frattini-like subgroups of a finite group
1994
Throughout the paper we consider only finite groups.J. C. Beidleman and H. Smith [3] have proposed the following question: “If G is a group and Ha subnormal subgroup of G containing Φ(G), the Frattini subgroup of G, such that H/Φ(G)is supersoluble, is H necessarily supersoluble? “In this paper, we give not only an affirmative answer to this question but also we see that the above result still holds if supersoluble is replaced by any saturated formation containing the class of all nilpotent groups.
Co-jumps and Markov Counting Systems in Random Environments
2020
Motivated by the analysis of multi-strain infectious disease data, we provide closed-form transition rates for continuous-time Markov chains that arise from subjecting Markov counting systems to correlated environmental noises. Noise correlation induces co-jumps or counts that occur simultaneously in several counting processes. Such co-jumps are necessary and sufficient for infinitesimal correlation between counting processes of the system. We analyzed such infinitesimal correlation for a specific infectious disease model by randomizing time of Kolmogorov’s Backward system of differential equations based on appropriate stochastic integrals.
Tally languages accepted by alternating multitape finite automata
1997
We consider k-tape 1-way alternating finite automata (k-tape lafa). We say that an alternating automaton accepts a language L\(\subseteq\)(Σ*)k with f(n)-bounded maximal (respectively, minimal) leaf-size if arbitrary (respectively, at least one) accepting tree for any (w1, w2,..., wk) ∈ L has no more than $$f\mathop {(\max }\limits_{1 \leqslant i \leqslant k} \left| {w_i } \right|)$$ leaves. The main results of the paper are the following. If k-tape lafa accepts language L over one-letter alphabet with o(log n)-bounded maximal leaf-size or o(log log n)-bounded minimal leaf-size then the language L is semilinear. Moreover, if a language L is accepted with o(log log(n))-bounded minimal (respe…
Fréchet Spaces of Holomorphic Functions without Copies of l 1
1996
Let X be a Banach space. Let Hw*(X*) the Frechet space whose elements are the holomorphic functions defined on X* whose restrictions to each multiple mB(X*), m = 1,2, …, of the closed unit ball B(X*) of X* are continuous for the weak-star topology. A fundamental system of norms for this space is the supremum of the absolute value of each element of Hw*(X*) in mB(X*), m = 1,2,…. In this paper we construct the bidual of l1 when this space contains no copy of l1. We also show that if X is an Asplund space, then Hw*(X*) can be represented as the projective limit of a sequence of Banach spaces that are Asplund.
The number of lifts of a Brauer character with a normal vertex
2011
AbstractIn this paper we examine the behavior of lifts of Brauer characters in p-solvable groups. In the main result, we show that if φ∈IBr(G) has a normal vertex Q and either p is odd or Q is abelian, then the number of lifts of φ is at most |Q:Q′|. As a corollary, we prove that if φ∈IBr(G) has an abelian vertex subgroup Q, then the number of lifts of φ in Irr(G) is at most |Q|.