Search results for "Conjecture"

Some remarks on the Erdős-Turán conjecture

1993

Vertices for characters of $p$-solvable groups

2002

Suppose that G is a finite p-solvable group. We associate to every irreducible complex character X ∈ Irr(G) of G a canonical pair (Q, δ), where Q is a p-subgroup of G and δ ∈ Irr(Q), uniquely determined by X up to G-conjugacy. This pair behaves as a Green vertex and partitions Irr(G) into families of characters. Using the pair (Q, δ), we give a canonical choice of a certain p-radical subgroup R of G and a character η ∈ Irr(R) associated to X which was predicted by some conjecture of G. R. Robinson.

On the Second Order Rational Difference Equation $$x_{n+1}=\beta +\frac{1}{x_n x_{n-1}}$$ x n + 1 = β + 1 x n x n - 1

2016

The author investigates the local and global stability character, the periodic nature, and the boundedness of solutions of the second-order rational difference equation $$x_{n+1}=\beta +\frac{1}{x_{n}x_{n-1}}, \quad n=0,1,\ldots ,$$ with parameter \(\beta \) and with arbitrary initial conditions such that the denominator is always positive. The main goal of the paper is to confirm Conjecture 8.1 and to solve Open Problem 8.2 stated by A.M. Amleh, E. Camouzis and G. Ladas in On the Dynamics of a Rational Difference Equations I (International Journal of Difference Equations, Volume 3, Number 1, 2008, pp.1–35).

Fittingmengen und lockettabschnitte

1990

Abstract The theory of Lockett sections is transferred from Fitting classes to Fitting sets. This in general works only partially; in some special groups (which I call “mobility” groups), however, among these the stable linear groups, a literal translation of the Fitting class theory is possible. As the groups relevant in outer Fitting pairs actually are mobility groups, a new way of deriving information on the Lockett section of a Fitting class arises. This is used to present a simplified, if nonsoluble, counter-example to Lockett's conjecture and to decide a related question. Also, an approach to generating Fitting classes is given.

Co-learnability and FIN-identifiability of enumerable classes of total recursive functions

1994

Co-learnability is an inference process where instead of producing the final result, the strategy produces all the natural numbers but one, and the omitted number is an encoding of the correct result. It has been proved in [1] that co-learnability of Goedel numbers is equivalent to EX-identifiability. We consider co-learnability of indices in recursively enumerable (r.e.) numberings. The power of co-learnability depends on the numberings used. Every r.e. class of total recursive functions is co-learnable in some r.e. numbering. FIN-identifiable classes are co-learnable in all r.e. numberings, and classes containing a function being accumulation point are not co-learnable in some r.e. number…

Tighter Relations between Sensitivity and Other Complexity Measures

2014

The sensitivity conjecture of Nisan and Szegedy [12] asks whether the maximum sensitivity of a Boolean function is polynomially related to the other major complexity measures of Boolean functions. Despite major advances in analysis of Boolean functions in the past decade, the problem remains wide open with no positive result toward the conjecture since the work of Kenyon and Kutin from 2004 [11].

Asymptotics for thenth-degree Laguerre polynomial evaluated atn

1992

We investigate the asymptotic behaviour of ? n (n),n?? where ? n (x) denotes the Laguerre polynomial of degreen. Our results give a partial answer to the conjecture ?? n (n)>1 forn>6, made in 1984 by van Iseghem. We also show the connection between this conjecture and the continued fraction approximants of $$6\sqrt {{3 \mathord{\left/ {\vphantom {3 \pi }} \right. \kern-\nulldelimiterspace} \pi }} $$ .

On Brauer’s Height Zero Conjecture

2014

In this paper, the unproven half of Richard Brauer’s Height Zero Conjecture is reduced to a question on simple groups.

Homogeneous products of characters

2004

I. M. Isaacs has conjectured (see \cite{isa00}) that if the product of two faithful irreducible characters of a solvable group is irreducible, then the group is cyclic. In this paper we prove a special case of the following conjecture, which generalizes Isaacs conjecture. Suppose that $G$ is solvable and that $\psi,\phi\in\Irr(G)$ are faithful. If $\psi \phi=m\chi$ where $m$ is a positive integer and $\chi \in \Irr(G)$ then $\psi$ and $\phi$ vanish on $G- Z(G)$. In particular we prove that the above conjecture holds for $p$-groups.

Brauer’s Height Zero Conjecture for principal blocks

2021

Abstract We prove the other half of Brauer’s Height Zero Conjecture in the case of principal blocks.