In a recent series of papers we have shown that including heavy quarks in the dibaryon sector can lead to configurations stable against decay into two baryons. In this study we extend our previous work by a study of all the physical Q q [Q denotes a heavy quark and q denotes a member of the SU(3)~ triplet representation] systems in a solvable chromomagnetic model. We propose a number of new hea...

The subgroup pattern of a finite groups G is the table of marks of G together with a list of representatives of the conjugacy classes of subgroups of G. In this article we present an algorithm for the computation of the subgroup pattern of a cyclic extension of G from the subgroup pattern of G. Repeated application of this algorithm yields an algorithm for the computation of the table of marks ...

We study the behaviour of prudent, perimeter and quasi-prudent self-avoiding walks and polygons in both two and three dimensions, as well as some solvable subsets. Our analysis combines exact solutions of some simpler cases, careful asymptotic analysis of functional equations which can be obtained in more complicated cases and extensive numerical studies based on exact series expansions for les...

Bound states generated by the K coupled PT −symmetric square wells are studied in a series of models where the Hamiltonians are assumed R−pseudo-Hermitian and R2−symmetric. Specific rotation-like generalized parities R are considered such that RN = I at some integers N . We show that and how our assumptions make the models exactly solvable and quasi-Hermitian. This means that they possess the r...

A series of exactly solvable non-trivial complex potentials (possessing real spectra) are generated by applying the Darboux transformation to the excited eigenstates of a non-Hermitian potential V (x). This method yields an infinite number of non-trivial partner potentials, defined over the whole real line, whose spectra are nearly exactly identical to the original potential. e-mail : anjana23@...

In this paper we study the permutation #owshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the "ve regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these "ve cases are solvable by presenting a polymonial-time s...

Memory effects in time-series of experimental observables are ubiquitous, have important cosequences for the interpretation kinetic data, and may even affect function biomolecular nanomachines such as enzymes. Here we propose a set complementary methods quantifying conclusively magnitude duration memory time series reaction coordinate. The toolbox is general, robust, easy to use, does not rely ...

We show that a current-biased series array of nonidentical Josephson junctions undergoes two transitions as a function of the spread of natural frequencies. One transition corresponds to the onset of partial synchronization, and the other corresponds to complete phase locking. In the limit of weak coupling and disorder, the system can be mapped onto an exactly solvable model introduced by Kuram...

We give a survey of new characterizations of finite solvable groups and the solvable radical of an arbitrary finite group which were obtained over the past decade. We also discuss generalizations of these results to some classes of infinite groups and their analogues for Lie algebras. Some open problems are discussed as well.