Related papers: A construction method for WZ seeds
In this paper, we propose a method to build molecular cages designed to capture a specific substrate. We model a cage as a graph of atoms with coordinates in space, and several constraints on their edges (degree, length and angle). We use a…
We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed sensitivity problem -- a set of target alignments, an associated…
In this thesis we explore natural procedures through which topological structure can be constructed from specific semigroups. We will do this in two ways: 1) we equip the semigroup object itself with a topological structure, and 2) we find…
Based on the WZ method, some series acceleration formulas are given. These formulas allow to write down an infinite family of parametrized identities from any given identity of WZ type. Further, this family, in the case of the Riemann Zeta…
We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families of cubic partial cubes as well as many sporadic examples.
We describe a procedure for generating families of cyclic cubic fields with explicit fundamental units. This method generates all known families and gives new ones.
We review some aspects of gauged WZW models. By choosing a nilpotent subgroup as gauge group, one is lead to three main applications: the construction of field theories with an extended conformal symmetry, the construction of the effective…
We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to construct seeds with optimal sensitivity/selectivity trade-offs. We…
This paper gives a simple method for constructing vector-valued Siegel modular forms from scalar-valued ones. The method is efficient in producing the siblings of Delta, the smallest weight cusp forms that appear in low degrees. It also…
We study the structures of arbitrary split Leibniz triple systems. By developing techniques of connections of roots for this kind of triple systems, under certain conditions, in the case of $T$ being of maximal length, the simplicity of the…
We classify the types of root systems $R$ in the rings of integers of number fields $K$ such that the Weyl group $W(R)$ lies in the group $\mathcal L(K)$ generated by ${\rm Aut} (K)$ and multiplications by the elements of $K^*$. We also…
We establish $q$-analogs for four congruences involving central binomial coefficients. The $q$-identities necessary for this purpose are shown via the $q$-WZ method.
We introduce a new approach that allows us to determine the structure of Zhu's algebra for certain vertex operator (super)algebras which admit horizontal $\mathbb{Z} $-grading. By using this method and an earlier description of Zhu's…
A general procedure is outlined which allows one to construct superintegrable models of Winternitz type. Some examples are presented.
An approximate but straight forward projection method to molecular many alpha-particle states is proposed and the overlap to the shell model space is determined. The resulting space is in accordance with the shell model, but still contains…
We give a graphical reinterpretation of the seeds algorithm to explore the tree of numerical semigroups. We then exploit the seeds algorithm to find all the Eliahou semigroups of genus up to 65. Since all these semigroups satisfy the Wilf…
We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…
In this paper we present a procedure to build the set of irreducible numerical semigroups with a fixed Frobenius number. The construction gives us a rooted tree structure for this set. Furthermore, by using the notion of Kunz-coordinates…
The obvious way to construct a GDD (group-divisible design) recursively is to use Wilson's Fundamental Construction for GDDs (WFC). Then a PBD (pairwise balanced design) is often obtained by adding a new point to each group of the GDD.…
The present note has three aims. First, to complement the theory of cofibrant generation of algebraic weak factorisation systems (AWFSs) to cover some important examples that are not locally presentable categories. Secondly, to prove that…