Related papers: Completing the Structural Analysis of the 2x4 Perm…
We summarize the results obtained in the last few years about permutation orbifolds in two-dimensional conformal field theories, their application to string theory and their use in the construction of four-dimensional heterotic string…
In the context of the genome rearrangement problem, we analyze two well known models, namely the reversal and the prefix reversal models, by exploiting the connection with the notion of permutation pattern. More specifically, for any $k$,…
We give a systematic and self-contained account of the construction of geometrically decomposed bases and degrees of freedom in finite element exterior calculus. In particular, we elaborate upon a previously overlooked basis for one of the…
This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects not covered in the recent book by Kitaev, \emph{Patterns in Permutations and words}. I first survey recent developments on the enumeration…
Permutation polynomials with few terms (especially permutation binomials) attract many people due to their simple algebraic structure. Despite the great interests in the study of permutation binomials, a complete characterization of…
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…
Several topics concerning nuclear structure and electromagnetic interactions of heavy nuclei are reviewed. These comprehend the deformed single-particle shell model, nuclear collective motion, symmetry breaking and approximate symmetry…
This work represents an in-depth study of the structural behavior of the Collatz sequences. We consider a finite arithmetic progression with a common difference is 2 and the number of terms in the sequence is equal to 2^n . After, we…
Let $q=2^m.$ In a recent paper \cite{Zhang3}, Zhang and Zheng investigated several classes of permutation pentanomials of the form $\epsilon_0x^{d_0}+L(\epsilon_{1}x^{d_1}+\epsilon_{2}x^{d_2})$ over ${\mathbb F}_{q^3}~(d_0=1,2,4)$ from some…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
Circular permutation connects the N and C termini of a protein and concurrently cleaves elsewhere in the chain, providing an important mechanism for generating novel protein fold and functions. However, their in genomes is unknown because…
We study the biparametric quantum deformation of GL(2) x GL(1) and exhibit its cross-product structure. We derive explictly the associated dual algebra, i.e., the quantised universal enveloping algebra employing the R-matrix procedure. This…
A general model for the fragmentation of a two-component system (e.g. protons and neutrons) is proposed and solved exactly. The extension of this model to any number of components is also shown to be exactly solvable. A connection between…
A novel approach for structure alignment is presented, where the key ingredients are: (1) An error function formulation of the problem simultaneously in terms of binary (Potts) assignment variables and real-valued atomic coordinates. (2)…
An algebraic definition of Gardner's deformations for completely integrable bi-Hamiltonian evolutionary systems is formulated. The proposed approach extends the class of deformable equations and yields new integrable evolutionary and…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…
We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…
Kernel classifiers and regressors designed for structured data, such as sequences, trees and graphs, have significantly advanced a number of interdisciplinary areas such as computational biology and drug design. Typically, kernels are…