Related papers: A Cycle Joining Construction of the Prefer-Max De …
$ n-$cycle permutation polynomials with small n have the advantage that their compositional inverses are efficient in terms of implementation. These permutation polynomials have significant applications in cryptography and coding theory. In…
The paper is devoted to a somewhat idiosyncratic account of the theorem of de Bruijn-Erd\"{o}s and Hanani from the combinatorics of finite geometries and its various proofs. Among the proofs discussed are the original proofs by de…
We state and prove a new closure theorem closely related to the classical closure theorems of Poncelet and Steiner. Along the way, we establish a number of theorems concerning conic sections.
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…
We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…
We give several related versions of global Grothendieck Duality for unbounded complexes on noetherian formal schemes. The proofs, based on a non-trivial adaptation of Deligne's method for the special case of ordinary schemes, are reasonably…
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…
A universal cycle for a set S of combinatorial objects is a cyclic sequence of length |S|that contains a representation of each element in S exactly once as a substring. If S is the set of k-subsets of [n] = {1, 2, . . . , n}, it is…
Most research on query optimization has centered on binary join algorithms like hash join and sort-merge join. However, recent years have seen growing interest in theoretically optimal algorithms, notably Yannakakis' algorithm. These…
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
For a set of integers $I$, we define a $q$-ary $I$-cycle to be a assignment of the symbols 1 through $q$ to the integers modulo $q^n$ so that every word appears on some translate of $I$. This definition generalizes that of de Bruijn cycles,…
In this paper we prove an analogue of the Koml\'os-Major-Tusn\'ady (KMT) embedding theorem for random walk bridges. The random bridges we consider are constructed through random walks with i.i.d jumps that are conditioned on the locations…
We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular word, or necklace, is the equivalence class of a word under…
In this article we study decreasing and increasing factorisations of the cycle, which are decompositions of the cycle $(1~2\dots n)$ into a product of $n-1$ transpositions satisfying monotonicity conditions. We explicit a bijection between…
For earlier considered our sequence A166944 in [4] we prove three statements of its connection with twin primes. We also give a sufficient condition for the infinity of twin primes and pose several new conjectures; among them we propose a…
A finite sequence of numbers is perfect if it has zero periodic autocorrelation after a nontrivial cyclic shift. In this work, we study quaternionic perfect sequences having a one-to-one correspondence with the binary sequences arising in…
Let $B=\{ B_{t}\} _{t\ge 0}$ be a one-dimensional standard Brownian motion. As an application of a recent result of ours on exponential functionals of Brownian motion, we show in this paper that, for every fixed $t>0$, the process given by…