Results 11 to 20 of about 9,769 (221)

Self-complementary hypergraphs and their self-complementing permutations

Electronic Notes in Discrete Mathematics, 2006
Abstract A k –uniform hypergraph H = ( V ; E ) is called self-complementary if there is a permutation σ : V → V , called self-complementing , such that for every k –subset e of V , e ∈ E if and only if σ ( e ) ∉ E . In other words, H is isomorphic with H ′ = ( V ; ( V k ) −
Artur Szymański, A. Paweł Wojda
openaire   +3 more sources

Verifying termination and error-freedom of logic programs with block declarations [PDF]

, 2001
We present verification methods for logic programs with delay declarations. The verified properties are termination and freedom from errors related to built-ins. Concerning termination, we present two approaches. The first approach tries to eliminate the
Hill, P.M., King, A., Smaus, J.-G.
core   +5 more sources

Testing the role of chain connectivity on the stability and structure of dihydrofolate reductase fromE. coli: Fragment complementation and circular permutation reveal stable, alternatively folded forms [PDF]

Protein Science, 2001
AbstractThe effects of chain cleavage and circular permutation on the structure, stability, and activity of dihydrofolate reductase (DHFR) fromEscherichia coliwere investigated by various spectroscopic and biochemical methods. Cleavage of the backbone after position 86 resulted in two fragments, {1–86} and {87–159}, each of which are poorly structured ...
V F, Smith, C R, Matthews
openaire   +2 more sources

On solvable minimally transitive permutation groups [PDF]

, 2007
We investigate properties of finite transitive permutation groups $(G, \Omega)$ in which all proper subgroups of $G$ act intransitively on $\Omega.$ In particular, we are interested in reduction theorems for minimally transitive representations of ...
Siemons, Johannes, Volta, Francesca Dalla   +1 more
core   +3 more sources

Novel Medical Image Encryption Scheme Based on Chaos and DNA Encoding

IEEE Access, 2019
In this paper, we propose a new chaos-based encryption scheme for medical images. It is based on a combination of chaos and DNA computing under the scenario of two encryption rounds, preceded by a key generation layer, and follows the permutation ...
Akram Belazi, Muhammad Talha, Sofiane Kharbech, Wei Xiang   +3 more
doaj   +1 more source

The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs

Discussiones Mathematicae Graph Theory, 2016
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N., Deshpande Charusheela M., Bam Bhagyashree Y.   +2 more
doaj   +1 more source

Complex Calogero model with real energies [PDF]

, 2000
We show that and how PT symmetry (interpreted as a "weakened Hermiticity") can be extended to the exactly solvable two- and three-particle Calogero model.Comment: 16 pages, 3 figures, submitted to J. Phys.
Alvarez G, Andrianov A A, Bagchi B, Bender C M, Bender C M, Bender C M, Bessis D, Buslaev V, Caliceti E, Calogero F, Fernández F M, Fernández F M, Flügge S, Flügge S, Herbst I, Landau L D, Lévai G, Mezincescu G A, Milos Tater, Miloslav Znojil, Prüfer H, Reed M, Rühl W, Turbiner A, Turbiner A, Ushveridze A G, Znojil M, Znojil M, Znojil M, Znojil M, Znojil M, Znojil M, Znojil M   +32 more
core   +2 more sources

Almost Self-Complementary 3-Uniform Hypergraphs

Discussiones Mathematicae Graph Theory, 2017
It is known that self-complementary 3-uniform hypergraphs on n vertices exist if and only if n is congruent to 0, 1 or 2 modulo 4. In this paper we define an almost self-complementary 3-uniform hypergraph on n vertices and prove that it exists if and ...
Kamble Lata N., Deshpande Charusheela M., Bam Bhagyashree Y.   +2 more
doaj   +1 more source

A note on self-complementary hypergraphs [PDF]

Opuscula Mathematica, 2005
In the paper we describe all self-complementary hypergraphs. It turns out that such hypergraphs exist if and only if the number of vertices of the hypergraph is of the form \(n=2^k\). This answers a conjecture posed by A.
Małgorzata Zwonek
doaj  

A note on self-complementary 4-uniform hypergraphs [PDF]

Opuscula Mathematica, 2005
We prove that a permutation \(\theta\) is complementing permutation for a \(4\)-uniform hypergraph if and only if one of the following cases is satisfied: (i) the length of every cycle of \(\theta\) is a multiple of \(8\), (ii) \(\theta\) has \(1\), \(2\)
Artur Szymański
doaj