Related papers: Strong Skolem Starters
Motivated by a problem in ergodic Ramsey theory, Furstenberg and Katznelson introduced the notion of strong stationarity, showing that certain recurrence properties hold for arbitrary measure preserving systems if they are valid for…
We prove new existence and nonexistence results for modular Golomb rulers in this paper. We completely determine which modular Golomb rulers of order $k$ exist, for all $k\leq 11$, and we present a general existence result that holds for…
Consider the recursive relation generating a new positive integer $n_{\ell +1}$ from the positive integer $n_{\ell }$ according to the following simple rules: if the integer $n_{\ell }$ is odd, $n_{\ell +1}=3n_{\ell }+1$; if the integer…
We prove that the groups PSL_n(q) are (2,3)-generated for n=9,10 or 11 and all q. Actually, we find out explicit generators x_n and y_n of respective orders 2 and 3, for the groups SL_n(q).
A Chevalley type integral basis for the ortho-symplectic Lie superalgebra is constructed. The simple modules of the ortho-symplectic supergroup over an algebraically closed field of prime characteristic not equal to 2 are classified, where…
Starting from a study of Y. Bugeaud and A. Dubickas (2005) on a question in distribution of real numbers modulo 1 via combinatorics on words, we survey some combinatorial properties of (epi)Sturmian sequences and distribution modulo 1 in…
An explicit construction of infinite sequences of strongly regular digraphs with parameter sets $((v+(2^{n+1}-4)t)2^{n-1}, k+(2^n-2)t, t, \lambda, t)$ is described. A computer program was used to find the initial digraphs. The remaining…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
With an explicit, algebraic indexing $(2,1)$-category, we develop an efficient homotopy theory of cyclonic objects: circle-equivariant objects relative to the family of finite subgroups. We construct an $\infty$-category of cyclotomic…
We introduce a class of finite dimensional nonlinear superalgebras $L = L_{\bar{0}} + L_{\bar{1}}$ providing gradings of $L_{\bar{0}} = gl(n) \simeq sl(n) + gl(1)$. Odd generators close by anticommutation on polynomials (of degree $>1$) in…
This document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…
A slalom is a sequence of finite sets of length omega. Slaloms are ordered by coordinatewise inclusion with finitely many exceptions. Improving earlier results of Mildenberger, Shelah and Tsaban, we prove consistency results concerning…
We study linear divisibility sequences of order 4, providing a characterization by means of their characteristic polynomials and finding their factorization as a product of linear divisibility sequences of order 2. Moreover, we show a new…
Strongly $\mathbb{Z}$-graded algebras or principal circle bundles and associated line bundles or invertible bimodules over a class of generalized Weyl algebras $\mathcal{B}(p;q, 0)$ (over a ring of polynomials in one variable) are…
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called partitions with designated summands. These are constructed by taking unrestricted integer partitions and designating exactly one of each occurrence…
We prove the existence of signed combinatorial interpretations for several large families of structure constants. These families include standard bases of symmetric and quasisymmetric polynomials, as well as various bases in Schubert…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
This paper provides a complete suite of axioms for a version of set theory that I call Explication. Explication borrows from the two most prominent existing systems of set theory. Explication starts with class variables. After several…
The projective variety of square-zero elements in the six-dimensional minimal supersymmetry algebra is isomorphic to $\mathbb{P}^1 \times \mathbb{P}^3$. We use this fact, together with the pure spinor superfield formalism, to study…
We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…