Related papers: Almost associative operations generating a minimal…

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

For a class C of operations on a nonempty base set A, an operation f is called a C-subfunction of an operation g, if f = g(h_1, ..., h_n), where all the inner functions h_i are members of C. Two operations are C-equivalent if they are…

Cooperative systems are systems in which the forces among agents are non-repulsive. The free evolution of such systems can tend to the formation of patterns, such as consensus or clustering, depending on the properties and intensity of the…

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…

Holomorphic almost modular forms are holomorphic functions of the complex upper half plane which can be approximated arbitrarily well (in a suitable sense) by modular forms of congruence subgroups of large index in $\SL(2,\ZZ)$. It is…

Markov Networks are widely used through out computer vision and machine learning. An important subclass are the Associative Markov Networks which are used in a wide variety of applications. For these networks a good approximate minimum cost…

We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…

We make several contributions to our recent program investigating structural properties of algebras of operators on a Hilbert space. For example, we make substantial contributions to the noncommutative peak interpolation program begun by…

We present randomized algorithms that compute $(1+\epsilon)$-approximate minimum global edge and vertex cuts in weighted directed graphs in $O(\log^4(n) / \epsilon)$ and $O(\log^5(n)/\epsilon)$ single-commodity flows, respectively. With the…

The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…

Joint measurements of qubit observables have recently been studied in conjunction with quantum information processing tasks such as cloning. Considerations of such joint measurements have until now been restricted to a certain class of…

An almost periodic function in finite-dimensional space extends to a holomorphic bounded function in a tube domain with a cone in the base if and only if the spectrum belongs to the conjugate cone. Also, an almost periodic function in…

Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…

We consider clones on countable sets. If such a clone has quasigroup operations, is locally closed and countable, then there is a function $f : \mathbb{N} \to \mathbb{N}$ such that the $n$-ary part of $C$ is equal to the $n$-ary part of…

We characterise the bracketing identities satisfied by linear quasigroups with the help of certain equivalence relations on binary trees that are based on the left and right depths of the leaves modulo some integers. The numbers of…

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A if and only if each one is a substitution instance of the other using operations from C. We study the…

This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…

To convert a fractional solution to an instance of a constraint satisfaction problem into a solution, a rounding scheme is needed, which can be described by a collection of symmetric operations with one of each arity. An intriguing…

We consider certain finite sets of circle-valued functions defined on intervals of real numbers and estimate how large the intervals must be for the values of these functions to be uniformly distributed in an approximate way. This is used…

The aim of this paper is to study the problem of the integration of Stepanov remotely almost periodic functions. We prove that every compact primitive of a Stepanov remotely almost periodic function with a minimal $\omega$-limit set is…