Displaying 41 – 60 of 1135

Showing per page

A geometric approach to universal quasigroup identities

Václav J. Havel (1993)

Archivum Mathematicum

In the present paper we construct the accompanying identity I ^ of a given quasigroup identity I . After that we deduce the main result: I is isotopically invariant (i.e., for every guasigroup Q it holds that if I is satisfied in Q then I is satisfied in every quasigroup isotopic to Q ) if and only if it is equivalent to I ^ (i.e., for every quasigroup Q it holds that in Q either I , I ^ are both satisfied or both not).

A Hajós type result on factoring finite abelian groups by subsets. II

Keresztély Corrádi, Sándor Szabó (2010)

Commentationes Mathematicae Universitatis Carolinae

It is proved that if a finite abelian group is factored into a direct product of lacunary cyclic subsets, then at least one of the factors must be periodic. This result generalizes Hajós's factorization theorem.

A Method for Classification of Doubly Resolvable Designs and Its Application

Zhelezova, Stela (2011)

Serdica Journal of Computing

This article presents the principal results of the Ph.D. thesis Investigation and classification of doubly resolvable designs by Stela Zhelezova (Institute of Mathematics and Informatics, BAS), successfully defended at the Specialized Academic Council for Informatics and Mathematical Modeling on 22 February 2010.The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs with an additional property - they have resolutions...

A note on a two dimensional knapsack problem with unloading constraints

Jefferson Luiz Moisés da Silveira, Eduardo Candido Xavier, Flávio Keidi Miyazawa (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In this paper we address the two-dimensional knapsack problem with unloading constraints: we have a bin B, and a list L of n rectangular items, each item with a class value in {1,...,C}. The problem is to pack a subset of L into B, maximizing the total profit of packed items, where the packing must satisfy the unloading constraint: while removing one item a, items with higher class values can not block a. We present a (4 + ϵ)-approximation algorithm when the bin is a square. We also present (3 + ϵ)-approximation...

Currently displaying 41 – 60 of 1135