Related papers: Universally defined cycles I

We complete the proof of a theorem we announced and partly proved in [Math. Nachr. 271 (2004), 69-90, math.AG/0111299]. The theorem concerns a family of curves on a family of surfaces. It has two parts. The first was proved in that paper.…

A universal cycle (u-cycle) for permutations of length $n$ is a cyclic word, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$ are covered. It is known that…

A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with m edges, graphs with loops,…

We prove in this paper the smoothability of cycles modulo rational equivalence in the Whitney range, that is, when the dimension is strictly smaller than the codimension. We introduce and study the class of cycles obtained as ``flat…

Generalized cycles can be thought of as the extension of form-cycle duality between holomorphic forms and cycles, to meromorphic forms and generalized cycles. They appeared as an ubiquitous tool in the study of spectral curves and…

Let $X$ be a smooth projective variety defined over a finite field. We show that any algebraic $1$-cycle on $X$ is rationally equivalent to a smooth $1$-cycle, which is a $\mathbb{Z}$-linear combination of smooth curves on $X$. We also…

A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing all permutations of length $n$ as factors. It is well known…

Let S be a complex smooth projective surface and L be a line bundle on S. For any given collection of isolated topological or analytic singularity types, we show the number of curves in the linear system |L| with prescribed singularities is…

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…

We prove explicit formulas for Chern classes of tensor products of vector bundles, with coefficients given by certain universal polynomials in the ranks of the two bundles.

Let $R$ be a smooth affine domain of dimension $d\geq 2$ over an infinite perfect field $k$. We establish a morphism from the Euler class group $E^d(R)$ to $Um_{d+1}(R)/E_{d+1}(R)$, the group of elementary orbits of unimodular rows.

A universal cycle (u-cycle) is a compact listing of a collection of combinatorial objects. In this paper, we use natural encodings of these objects to show the existence of u-cycles for collections of subsets, matroids, restricted…

Universal cycles, such as De Bruijn cycles, are cyclic sequences of symbols that represent every combinatorial object from some family exactly once as a consecutive subsequence. Graph universal cycles are a graph analogue of universal…

A Universal Cycle for t-multisets of [n]={1,...,n} is a cyclic sequence of $\binom{n+t-1}{t}$ integers from [n] with the property that each t-multiset of [n] appears exactly once consecutively in the sequence. For such a sequence to exist…

This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…

A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian, this baseline result is used as the basis of existence proofs for universal cycles (also known as generalized deBruijn cycles or U-cycles) of…

The goal of this work is to construct integral Chern classes and higher cycle classes for a smooth variety over a perfect field of characteristic p>0 that are compatible with the rigid Chern classes defined by Petrequin. The Chern classes…

A universal cycle is a cyclic sequence in which each object of a combinatorial family appears exactly once as a contiguous window. While such cycles are well understood for many discrete structures and linear subspaces, the case of affine…

A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian; this baseline result is used as the basis of existence proofs for universal cycles (also known as deBruijn cycles or $U$-cycles) of several…

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…