Search results for "General Mathematics"

Classification of n-dimensional subvarieties of G(1, 2n) that can be projected to G(1, n + 1)

2005

A structure theorem is given for n-dimensional smooth subvarieties of the Grassmannian G(1, N); with N >= n + 3, that can be isomorphically projected to G(1, n + 1). A complete classification in the cases N = 2n + 1 and N = 2n follows, as a corollary.

Invariant characters and coprime actions on finite nilpotent groups

2000

Suppose that a group A acts via automorphisms on a nilpotent group G having coprime order. Given an A-invariant character \(\chi \in {\rm Irr}(G)\), we show that the A-primitive irreducible characters that induce \(\chi \) from an A-invariant subgroup of G all have equal degree. We use this result to obtain some information about the characters of groups of p-length 1.

Symmetric identities in graded algebras

1997

Let P k be the symmetric polynomial of degree k i.e., the full linearization of the polynomial x k . Let G be a cancellation semigroup with 1 and R a G-graded ring with finite support of order n. We prove that if R 1 satisfies $ P_k \equiv 0 $ then R satisfies $ P_{kn} \equiv 0 $ .

Codimension growth of two-dimensional non-associative algebras

2007

Let F be a field of characteristic zero and let A be a two-dimensional non-associative algebra over F. We prove that the sequence c n (A), n =1,2,..., of codimensions of A is either bounded by n + 1 or grows exponentially as 2 n . We also construct a family of two-dimensional algebras indexed by rational numbers with distinct T-ideals of polynomial identities and whose codimension sequence is n + 1, n > 2.

Symmetric units and group identities

1998

In this paper we study rings R with an involution whose symmetric units satisfy a group identity. An important example is given by FG, the group algebra of a group G over a field F; in fact FG has a natural involution induced by setting g?g −1 for all group elements g∈G. In case of group algebras if F is infinite, charF≠ 2 and G is a torsion group we give a characterization by proving the following: the symmetric units satisfy a group identity if and only if either the group of units satisfies a group identity (and a characterization is known in this case) or char F=p >0 and 1) FG satisfies a polynomial identity, 2) the p-elements of G form a (normal) subgroup P of G and G/P is a Hamiltonia…

THE PROBABILITY THAT AND COMMUTE IN A COMPACT GROUP

2012

AbstractIn a recent article [K. H. Hofmann and F. G. Russo, ‘The probability that$x$and$y$commute in a compact group’,Math. Proc. Cambridge Phil Soc., to appear] we calculated for a compact group$G$the probability$d(G)$that two randomly selected elements$x, y\in G$satisfy$xy=yx$, and we discussed the remarkable consequences on the structure of$G$which follow from the assumption that$d(G)$is positive. In this note we consider two natural numbers$m$and$n$and the probability$d_{m,n}(G)$that for two randomly selected elements$x, y\in G$the relation$x^my^n=y^nx^m$holds. The situation is more complicated whenever$n,m\gt 1$. If$G$is a compact Lie group and if its identity component$G_0$is abelian,…

Vector-valued meromorphic functions

2002

A locally complete locally convex space E satisfies that every weakly meromorphic function defined on an open subset of \( \mathbb{C} \) with values in E is meromorphic if and only if E does not contain a countable product of copies of \( \mathbb{C} \). A characterization of locally complete spaces in the spirit of known characterizations of the (metric) convex compactness property is also given.

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams

2017

We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to “width” complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called “reordering”), which allows to build Boolean function g from Boolean Function f, such that if for f we have gap between quantum and deterministic OBDD complexity for natural order of variables, then we have almost the same gap for function g, but for any order. Using it we construct the total function REQ which deterministic OBDD complexity is \(2^{\varOmega (n/log n)}\) and present quantum OBD…

Unconditionally convergent multipliers and Bessel sequences

2016

Abstract We prove that every unconditionally summable sequence in a Hilbert space can be factorized as the product of a square summable scalar sequence and a Bessel sequence. Some consequences on the representation of unconditionally convergent multipliers are obtained, thus providing positive answers to a conjecture by Balazs and Stoeva in some particular cases.

The real cubic case of Mahler's conjecture

1961