Axiomatisability problems for <Emphasis Type="Italic">S</Emphasis>-posets

Let \(\mathcal{C}\) be a class of ordered algebras of a given fixed type τ. Associated with the type is a first order language L _τ , which must also contain a binary predicate to be interpreted by the ordering in members of \(\mathcal{C}\). One can then ask the question, when is the class \(\mathcal{C}\) axiomatisable by sentences of L _τ ? In this paper we will be considering axiomatisability problems for classes of left S-posets over a pomonoid S (that is, a monoid S equipped with a partial order compatible with the binary operation). We aim to determine the pomonoids S such that certain categorically defined classes are axiomatisable. The classes we consider are the free S-posets, the projective S-posets and classes arising from flatness properties. Some of these cases have been studied in a recent article by Pervukhin and Stepanova. We present some general strategies to determine axiomatisability, from which their results for the classes of weakly po-flat and po-flat S-posets will follow. We also consider a number of classes not previously examined.     

A universal planar automaton is determined by its semigroup of input symbols

Universal planar automata are universally attracted objects in the category of automata, for which the set of states and the set of output symbols are equipped with structures of planes. We investigate the problem of determinability of these automata by their semigroups of input symbols.     

An odd characterization of the generalized odd graphs

We show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is distance-regular, and in particular that it is a generalized odd graph.     

The role of crossover operator in the genetic optimization of magnetic models

The Ising model, introduced almost 100 years ago by Wilhelm Lenz and Ernst Ising, is the formalism still popular as a tool to describe magnetic properties of a wide class of materials. Among many issues which arise when using this model there exist problems related to the process of finding minimum energy of the system. Since these problems are NP-hard, optimizations can either be performed for some approximated cases or be the subject of global optimization techniques. In this paper we present an analysis of the effect of different crossover operators on the efficiency of genetic algorithm used to minimize energy in the Ising model. Although it is not a benchmark tool, we hope it may be interesting as a testing tool.     

Numerical treatment of solving singular integral equations by using Sinc approximations

In this paper we propose numerical treatment for singular integral equations. The methods are developed by means of the Sinc approximation with smoothing transformations. Such approximation is an effective technique against the singularities of the equations, and achieves exponential convergence. Therefore the methods improve conventional results where only polynomial convergence have been reported. The resulting algebraic system is solved by least squares approximation and leap frog algorithm. Estimation of errors of the approximate solution is presented. Some experimental tests are presented to show the efficient of the proposed methods.     

Hybrid Hamilton-Webster and the Greek apportionment

The method of largest remainders (Hamilton) is used for allotment of 288 of the seats among the 56 Greek constituencies. This method possesses various paradoxes as was observed through two centuries of application. So we propose a modification where the seats are allocated at a first stage by the lower Hare-Quota and the additional ones using the method of major fractions (Webster) restricted simultaneously by the upper quota. This method may produce paradoxes but they are observed extremely rare. Extended simulations over the Greek electoral data indicate that the frequency that the new method violates monotonicity is by far less than the frequency that Webster method violates quota.     

Unsteady Solutions of Euler Equations Generated by Steady Solutions

Invariant solutions of partial differential equations are found by solving a reduced system involving one independent variable less. When the solutions are invariant with respect to the so-called projective group, the reduced system is simply the steady version of the original system. This feature enables us to generate unsteady solutions when steady solutions are known. The knowledge of an optimal system of subalgebras of the principal Lie algebra admitted by a system of differential equations provides a method of classifying H-invariant solutions as well as constructing systematically some transformations (essentially different transformations) mapping the given system to a suitable form. Here the transformations allowing to reduce the steady two-dimensional Euler equations of gas dynamics to an equivalent autonomous form are classified by means of the program SymboLie, after that an optimal system of two-dimensional subalgebras of the principal Lie algebra has been calculated. Some steady solutions of two-dimensional Euler equations are determined, and used to build unsteady solutions.     

Distributive Lattices with a Generalized Implication: Topological Duality

In this paper we introduce the notion of generalized implication for lattices, as a binary function ⇒ that maps every pair of elements of a lattice to an ideal. We prove that a bounded lattice A is distributive if and only if there exists a generalized implication ⇒ defined in A satisfying certain conditions, and we study the class of bounded distributive lattices A endowed with a generalized implication as a common abstraction of the notions of annihilator (Mandelker, Duke Math J 37:377–386, 1970), Quasi-modal algebras (Celani, Math Bohem 126:721–736, 2001), and weakly Heyting algebras (Celani and Jansana, Math Log Q 51:219–246, 2005). We introduce the suitable notions of morphisms in order to obtain a category, as well as the corresponding notion of congruence. We develop a Priestley style topological duality for the bounded distributive lattices with a generalized implication. This duality generalizes the duality given in Celani and Jansana (Math Log Q 51:219–246, 2005) for weakly Heyting algebras and the duality given in Celani (Math Bohem 126:721–736, 2001) for Quasi-modal algebras.     

A bound on the generalized competition index of a primitive matrix using Boolean rank

For a positive integer m where 1?m?n, the m-competition index (generalized competition index) of a primitive digraph is the smallest positive integer k such that for every pair of vertices x and y, there exist m distinct vertices v₁,v₂,…,v_m such that there are directed walks of length k from x to v_i and from y to v_i for 1?i?m. The m-competition index is a generalization of the scrambling index and the exponent of a primitive digraph. In this study, we determine an upper bound on the m-competition index of a primitive digraph using Boolean rank and give examples of primitive Boolean matrices that attain the bound.