Let G be a connected reductive linear algebraic group. We use geometric methods to investigate G-completely reducible subgroups of G, giving new criteria for G-complete reducibility. We show that a subgroup of G is G-completely reducible if and only if it is strongly reductive in G; this allows us to use ideas of R.W. Richardson and Hilbert– Mumford–Kempf from geometric invariant theory. We ded...

in this paper, we study projective randers change and c-conformal change of p-reduciblemetrics. then we show that every p-reducible generalized landsberg metric of dimension n  2 must be alandsberg metric. this implies that on randers manifolds the notions of generalized landsberg metric andberwald metric are equivalent.

Given a field [Formula: see text] and text], we say that polynomial has newly reducible text]th iterate over if is irreducible but not (here denotes the of text]). We pose problem characterizing, for given fields such there exists degree with iterate, similar admitting infinitely many text]. give results in cases as well when In particular, show all these pairs, are monic Curiously, minimal gol...

A partial information algorithm for a language A computes, for some fixed m, for input words x1, . . . , xm a set of bitstrings containing χA(x1, . . . , xm). E.g., p-selective, approximable, and easily countable languages are defined by the existence of polynomial-time partial information algorithms of specific type. Self-reducible languages, for different types of self-reductions, form subcla...

The classiication technique by Non-Reducible Descriptors provides decision rules in term of Boolean formulae on object's key features. In this paper we present an extension of the Non-Reducible Descriptors that contains quantitative information. By Quantitative Non-Reducible Descriptor of an object, the distance to the descriptions of objects from another classes is explicitly expressed. This f...

The P,-reducible graphs are a natural generalization of the well-known class of cographs, with applications to scheduling, computational semantics, and clustering. More precisely, the Pa-reducible graphs are exactly the graphs none of whose vertices belong to more than one chordless path with three edges. A remarkable property of P,-reducible graphs is their unique tree representation up to iso...

Let G be a connected reductive linear algebraic group. We use geometric methods to investigate G-completely reducible subgroups of G, giving new criteria for G-complete reducibility. We show that a subgroup of G is G-completely reducible if and only if it is strongly reductive in G; this allows us to use ideas of R.W. Richardson and Hilbert– Mumford–Kempf from geometric invariant theory. We ded...