Related papers: q-Steiner Systems Do Exist
A Steiner quadruple system of order v is a 3-(v,4,1) design, and will be denoted SQS(v). Using the classification of finite 2-transitive permutation groups all SQS(v) with a flag-transitive automorphism group are completely classified, thus…
A Steiner triple system is a set $S$ together with a collection $\mathcal{B}$ of subsets of $S$ of size 3 such that any two elements of $S$ belong to exactly one element of $\mathcal{B}$. It is well known that the class of finite Steiner…
We define two finite q-analogs of certain multiple harmonic series with an arbitrary number of free parameters, and prove identities for these q-analogs, expressing them in terms of multiply nested sums involving the Gaussian binomial…
We derive explicit expressions for the generating series of the fundamental solutions of the $A_r$ quantum $Q$-system of Ref. [P. Di Francesco and R. Kedem, arXiv:1006.4774 [math-ph]], expressed in terms of any admissible initial data.…
Fix a prime power $q$ and parameters $1\leq t\leq k\leq n$, the corresponding Steiner system in the Grassmann scheme, or the $q$-Steiner system, is a collection $\mathfrak{B}$ of $k$-dimensional subspaces of $\mathbb{F}_{q}^n$ such that for…
$\textit{Normalizer circuits}$ [1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems $\mathcal{H}_{d_1}\otimes ... \otimes \mathcal{H}_{d_n}$ with a standard basis labeled by the elements of a finite…
Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…
A design is $G$-additive with $G$ an abelian group, if its points are in $G$ and each block is zero-sum in $G$. All the few known ``manageable" additive Steiner 2-designs are $\mathrm{EA}(q)$-additive for a suitable $q$, where…
We characterize permanence of planar S-systems. Further, we construct a planar S-system with three limit cycles.
We give an $n$-space generalized $q$-binomial theorem, and some new $q$ series identities that resemble the traditional $q$ series partition generating functions. These identities enumerate stepping stone weighted vector partitions.
Stirling number of the first and the second kinds have seen many generalizations and applications in various areas of mathematics. We introduce some combinatorial parameters which realize $q$-analogues and Broder's $r$-variants of Stirling…
In this paper we define the generalized q-analogues of Euler sums and present a new family of identities for q-analogues of Euler sums by using the method of Jackson q-integral rep- resentations of series. We then apply it to obtain a…
In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem…
By solving an infinite nonlinear system of $q$-difference equations one constructs a chain of $q$-difference operators. The eigenproblems for the chain are solved and some applications, including the one related to $q$-Hahn orthogonal…
The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…
We consider spin-chain-star systems characterized by N-wise many-body interactions between the spins in each chain and the central one. We show that such systems can be exactly mapped into standard spin-star systems through unitary…
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named…
Based on our studies done on two-dimensional autonomous systems, forced non-autonomous systems and time-delayed systems, we propose a unified methodology - that uses renormalization group theory - for finding out existence of periodic…
We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.