Related papers: Universally defined cycles I
We prove the effectivity of the dynatomic cycles for morphisms of projective varieties. We then analyze the degrees of the dynatomic cycles and multiplicities of formal periodic points and apply these results to the existence of periodic…
We use the equivariant cohomology ring of the permutohedral variety to study matroids and their invariants. Investigating the pushforward of matroid Chern classes defined by A. Berget, C. Eur, H. Spink and D. Tseng to the product space…
A theorem of Jannsen asserts that if a smooth projective variety has injective cycle class maps, it has surjective cycle class maps. The object of this note is to present a version of Jannsen's theorem for singular quasi--projective…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
In this work we consider families of smooth vector fields having a persistent polycycle with $n$ hyperbolic saddles. We derive the asymptotic expansion of the return map associated to the polycycle, determining explicitly its leading terms.…
Let G be a complex connected semisimple group, whose simple components have type A or D. We prove that wonderful G-varieties are classified by means of combinatorial objects called spherical systems. This is a generalization of a known…
We investigate the viability of defining an intersection product on algebraic cycles on a singular algebraic variety by pushing forward intersection products formed on a resolution of singularities. For varieties with resolutions having a…
The combinatorial description via ribbon graphs of the moduli space of Riemann surfaces makes it possible to define combinatorial cycles in a natural way. Witten and Kontsevich first conjectured that these classes are polynomials in the…
In this paper, we generalize \cite{IosevichParshall}, \cite{LongPaths} and \cite{cycles} by allowing the \emph{distance} between two points in a finite field vector space to be defined by a general non-degenerate bilinear form or quadratic…
We use category theory to propose a unified approach to the Schur-Weyl dualities involving the general linear Lie algebras, their polynomial extensions and associated quantum deformations. We define multiplicative sequences of algebras…
Let $K$ be an algebraically closed field of characteristic $0$. For $m\geq n$, we define $\tau_{m,n,k}$ to be the set of $m\times n$ matrices over $K$ with kernel dimension $\geq k$. This is a projective subvariety of $\bbP^{mn-1}$, and is…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
A De Bruijn cycle is a cyclic sequence in which every word of length $n$ over an alphabet $\mathcal{A}$ appears exactly once. De Bruijn tori are a two-dimensional analogue. Motivated by recent progress on universal partial cycles and words,…
We point out a gap in Murre's proof of the existence of a universal regular homomorphism for codimension $2$ cycles on a smooth projective variety, and offer two arguments to fill this gap.
We prove a Universal Coefficient Theorem for objects in the bootstrap class in the equivariant Kasparov category for a finite cyclic group of square-free order.
We prove the functoriality for proper push-forward of the characteristic cycles of constructible complexes by morphisms of smooth projective schemes over a perfect field, under the assumption that the direct image of the singular support…
For families of smooth complex projective varieties we show that normal functions arising from algebraically trivial cycle classes are algebraic, and defined over the field of definition of the family. In particular, the zero loci of those…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
For any directed graph G with vertex set V, the graph G^(d) is said to be a subset power of G and is defined to have vertex set equal to the set of d-element subsets of V; in G^(d), there is an edge from A to B if and only if we can label…
Using a sums of squares formula for two variable polynomials with no zeros on the bidisk, we are able to give a new proof of a representation for distinguished varieties. For distinguished varieties with no singularities on the two-torus,…