相关论文: Generalized de Bruijn Cycles

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…

A mutation cycle is a cycle in a graph whose vertices are labeled by the quivers in a given mutation class and whose edges correspond to single mutations. For any fixed $n\ge 4$, we describe arbitrarily long mutation cycles involving…

Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of $q$-ary linear codes derived from irreducible cyclic…

We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…

In this short note, we simply collect some known results about representing algebraic cycles by various kind of "nice" (e.g. smooth, local complete intersection, products of local complete intersection) algebraic cycles, up to rational…

In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. A graph is called cyclically orientable if it admits an orientation in which every chordless cycle is cyclically oriented. We propose an…

On a reduced analytic space $X$ we introduce the concept of a generalized cycle, which extends the notion of a formal sum of analytic subspaces to include also a form part. We then consider a suitable equivalence relation and corresponding…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $xy\in E$. For integers $n>k>0 $, the shift graph $G(n,k)$ is the graph whose vertex set…

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…

We use modular arithmetic to construct a de Bruijn array containing all fillings of an L (a 2 x 2 array with the upper right corner removed) with digits chosen from {0,...,k-1}.

In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…

The number of shortest factorizations into reflections for a Singer cycle in GL_n(F_q) is shown to be (q^n-1)^(n - 1). Formulas counting factorizations of any length, and counting those with reflections of fixed conjugacy classes are also…

We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with large diameter must…

In this paper, we give a refinement of a generalized Dedekind's theorem. In addition, we show that all possible values of integer group determinants of any group are also possible values of integer group determinants of its any abelian…

We study the period of the linear map $T:\mathbb{Z}_m^n\rightarrow \mathbb{Z}_m^n:(a_0,\dots,a_{n-1})\mapsto(a_0+a_1,\dots,a_{n-1}+a_0)$ as a function of $m$ and $n$, where $\mathbb{Z}_m$ stands for the ring of integers modulo $m$. Since…

Cyclic proof theory breaks tradition by allowing certain infinite proofs: those that can be represented by a finite graph, while satisfying a soundness condition. We reconcile cyclic proofs with traditional finite proofs: we extend abstract…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

Let $C_{k}$ (resp. $P_{k}$) denote the cycle (resp. path) of length $k$. In this paper, we examine the necessary and sufficient conditions for the existence of a $(8; p, q)$-decomposition of tensor product and wreath product of complete…

We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…

We formulate and explain the extended Burrows-Wheeler transform of Mantaci et al from the viewpoint of permutations on a chain taken as a union of partial order-preserving mappings. In so doing we establish a link with syntactic semigroups…