Related papers: A Cycle Joining Construction of the Prefer-Max De …

We consider chaining multiplicative-inverse operations in finite fields under alternating polynomial bases. When using two distinct polynomial bases to alternate the inverse operation we obtain a partition of $\mathbb F_{p^n}\setminus…

In 1972 Mykkeltveit proved that the maximum number of vertex-disjoint cycles in the de Bruijn graphs of order $n$ is attained by the pure cycling register rule, as conjectured by Golomb. We generalize this result to the tensor product of…

Consider the stable matching problem on two sets. We introduce the concept of a preference cycle and show how its natural presence in stable matchings proves a series of classical results in an elementary way.

In this paper, we obtain some new results on closed subschemes. Specially, we define natural addition and multiplication on the closed subschemes of a scheme. It is shown that "the multiplication" precisely coincides with the well known…

A cyclic proof system allows us to perform inductive reasoning without explicit inductions. We propose a cyclic proof system for HFLN, which is a higher-order predicate logic with natural numbers and alternating fixed-points. Ours is the…

The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

A classic and fundamental result about the decomposition of random sequences into a mixture of simpler ones is de Finetti's Theorem. In its original form it applies to infinite 0-1 valued exchangeable sequences. Later it was extended and…

This paper proves a deformation circle pattern theorem, which gives a complete description of those circle patterns with interstices in terms of the combinatorial type, the exterior intersections angles and the conformal structures of…

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1992. They have been developed by many authors since, for various combinatorial objects such as…

Cyclic structure and dynamics are of great interest in both the fields of stochastic processes and nonequilibrium statistical physics. In this paper, we find a new symmetry of the Brownian motion named as the quasi-time-reversal invariance.…

We construct feedback functions of Nonlinear Feedback Shift Registers from those of Linear Feedback Shift Registers using the cross-join pairs method and the Zech logarithms in finite fields. We present a hypothetical algorithm to generate…

Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…

We give two equivalent formulations of a conjecture [2,4] on the number of arc-disjoint Hamiltonian cycles in De Bruijn graphs.

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…

We prove the Complete nontrivial cycle-intersection theorem for systems of permutations.

We present an algebraic construction of trace-based De Bruijn tori over finite fields, focusing on the nonzero variant that omits the all-zero pattern. The construction arranges nonzero field elements on a toroidal grid using two…

This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature…

We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the preferential compactness mechanism have complex…