Related papers: A refinement of the Parshin symbol for surfaces
We present a new method for the numerical evaluation of arbitrary loop integrals in dimensional regularization. We first derive Mellin-Barnes integral representations and apply an algorithmic technique, based on the Cauchy theorem, to…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
We compute the Chern subgroup of the 4-th integral cohomology group of a certain classifying space and show that it is a proper subgroup. Such a classifying space gives us new counterexamples for the integral Hodge and Tate conjectures…
We establish the enumerativity of (original and modified) Welschinger invariants for every real divisor on any real algebraic Del Pezzo surface and give an algebro-geometric proof of the invariance of that count both up to variation of the…
The purpose of this paper is to extend the scope of the Ehrhart theory to periodic graphs. We give sufficient conditions for the growth sequences of periodic graphs to be a quasi-polynomial and to satisfy the reciprocity laws. Furthermore,…
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
We develop a diagrammatic categorification of the polynomial ring Z[x], based on a geometrically defined graded algebra. This construction generalizes to categorification of some special functions, such as Chebyshev polynomials.…
This is a preliminary report on the Contou-Carrere symbol for surfaces. It consists of two parts. In the first part, we recall technical results needed to define the symbol. The second part is where we compute all components of the…
Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…
As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplification algorithms are not well suited for this task because…
Building on the work [18], where some standard basis for the queer $q$-Schur superalgebra $\mathcal{Q}_q(n,r;R)$ is defined by a labelling set of matrices and their associated double coset representatives, we investigate the matrix…
The revised version has two additional references and a shorter proof of Proposition 5.7. This version also makes numerous small changes and has an appendix containing a proof of the degree formula for a parametrized surface.
In a recent paper, Matthew Baker and Oliver Lorscheid showed that Descartes's Rule of Signs and Newton's Polygon Rule can both be interpreted as multiplicities of polynomials over hyperfields. Hyperfields are a generalization of fields…
We prove that the G\"ottsche-Schroeter and Schroeter-Shustin refined invariants specialize at $q=1$ to the enumeration of rational, resp. elliptic complex curves on arbitrary toric surfaces matching constraints that consist of points and of…
Classical results in sparse recovery guarantee the exact reconstruction of $s$-sparse signals under assumptions on the dictionary that are either too strong or NP-hard to check. Moreover, such results may be pessimistic in practice since…
In this paper we study multiple Dedekind symbols and the associated multiple reciprocity functions. There is a bijection between the two sets of them after a normalization. By this bijection we define products of multiple reciprocity…
We study the regularity of Fourier integral operators, by allowing their symbols to satisfy certain multi-parameter characteristics. As a result, we give an extension of Seeger-Sogge-Stein theorem on product spaces.
The idea to use classical hypergeometric series and, in particular, well-poised hypergeometric series in diophantine problems of the values of the polylogarithms has led to several novelties in number theory and neighbouring areas of…
Cholesky linear solvers are a critical bottleneck in challenging applications within computer graphics and scientific computing. These applications include but are not limited to elastodynamic barrier methods such as Incremental Potential…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…