Related papers: Scaled Arndt Compositions
Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent research. We survey this work, classify, and relate the…
Since its introduction by Symons, the semigroup of maps with restricted range has been studied in the context of transformations on a set, or of linear maps on a vector space. Sets and vector spaces being particular examples of independence…
The study of string models including both unoriented closed strings and open strings presents a number of new features when compared to the standard case of models of oriented closed strings only. We review some basic features of the…
We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types)…
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…
The framework of a new scale invariant analysis on a Cantor set $C\subset $ $% I=[0,1] $, presented originally in {\it S. Raut and D. P. Datta, Fractals, 17, 45-52, (2009)}, is clarified and extended further. For an arbitrarily small…
This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…
Polyphonic music files were analyzed using the set of symbols that produced the Minimal Entropy Description which we call the Fundamental Scale. This allowed us to create a novel space to represent music pieces by developing: a) a method to…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…
The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the…
A new set of boundary conditions for string propagators is proposed in this paper. The boundary conditions are parametrized by a complex number $\lambda$. Under these new boundary conditions, the left-moving and right-moving modes are…
The problem of reconstructing strings from substring information has found many applications due to its importance in genomic data sequencing and DNA- and polymer-based data storage. One practically important and challenging paradigm…
In this work, we study the generalized sorting problem, where we are given a set of $n$ elements to be sorted, but only a subset of all possible pairwise element comparisons is allowed. We look at the problem from the perspective of the…
Partially ordered sets have received much attention in recent years, not just due to their usefulness in combinatorics and abstract algebra, but also due to their practical applications in fields ranging from chemistry to macroeconomics.…
The Selberg integral is an important integral first evaluated by Selberg in 1944. Stanley found a combinatorial interpretation of the Selberg integral in terms of permutations. In this paper, new combinatorial objects "Young books" are…
We present a statistical analysis of music scores from different composers using detrended fluctuation analysis. We find different fluctuation profiles that correspond to distinct auto-correlation structures of the musical pieces. Further,…
In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the $t$-adesign, which was coined by Cunsheng Ding in 2015. It is clear that $2$-adesigns are a kind of partially balanced…
String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving approaches have become popular over the last years given the massive use of strings in different application…