Related papers: A Simple Formula for Generating Chern Characters b…
We introduce a certain index of a collection of germs of 1-forms on a germ of a singular variety which is a generalization of the local Euler obstruction corresponding to Chern numbers different from the top one.
We give a direct interpretation of Neumann's combinatorial formula for the Chern-Simons invariant of a 3-manifold with a representation in PSL(2,C) whose restriction to the boundary takes values in upper triangular matrices. Our…
We use flat antiholomorphic superconnections to study orbifold Chern character following the method introduced by Bismut, Shen, and Wei. We show the uniqueness of orbifold Chern character by proving a Riemann-Roch-Grothendieck theorem for…
We derive a formula for the Chern classes of the bundles of conformal blocks on \bar{M}_{0,n} associated to simple finite dimensional Lie algebras and explore its consequences in more detail for sl_2 and in general for level 1. We also give…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
Handwritten characters can be trickier to classify due to their complex and cursive nature compared to simple and non-cursive characters. We present an external classifier along with a Generative Adversarial Network that can classify highly…
Let $\pi\colon P\to M$ be a principal bundle and $p$ an invariant polynomial of degree r on the Lie algebra of the structure group. The theory of Chern-Simons differential characters is exploited to define an homology map $\chi^{k} :…
We consider a short sequence of hermitian vector bundles on some arithmetic variety. Assuming that this sequence is exact on the generic fiber we prove that the alternated sum of the arithmetic Chern characters of these bundles is the sum…
Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis…
Can a user create a deep generative model by sketching a single example? Traditionally, creating a GAN model has required the collection of a large-scale dataset of exemplars and specialized knowledge in deep learning. In contrast,…
Following Bloch-Esnault-Kerz and Green-Griffiths' recent works on deformation of algebraic cycle classes, we use Chern character from K-theory to negative cyclic homology to show how to eliminate obstructions to deforming cycles.
Closed formulae are constructed for the characters and dimensions of the finite dimensional simple modules of the queer Lie superalgebra q(n). This is achieved by refining Brundan's algorithm for computing simple q(n)-characters.
Discrete orthogonal matrices have several applications in information technology, such as in coding and cryptography. It is often challenging to generate discrete orthogonal matrices. A common approach widely in use is to discretize…
A procedure is described that makes use of the generating function of characters to obtain a new generating function $H$ giving the multiplicities of each weight in all the representations of a simple Lie algebra. The way to extract from…
Let $M$ be a simple 3-manifold with a toral boundary component. It is known that if two Dehn fillings on $M$ along the boundary produce a reducible manifold and a toroidal manifold, then the distance between the filling slopes is at most…
Due to the huge category number, the sophisticated combinations of various strokes and radicals, and the free writing or printing styles, generating Chinese characters with diverse styles is always considered as a difficult task. In this…
In this paper, we establish a Gauss-Bonnet-Chern theorem for general closed complex Finsler manifolds.
I calculate characters of certain representations of loop groups based on non simply connected Lie groups. This gives a generalization of the Kac-Weyl character formula.
We find an explicit formula for the generating function for the squaring the terms of an $\ell^{th}$ order linear recurrence.
We propose a learning based method for generating new animations of a cartoon character given a few example images. Our method is designed to learn from a traditionally animated sequence, where each frame is drawn by an artist, and thus the…