Related papers: On some rational generating series occuring in ari…
Explanation methods aim to make neural networks more trustworthy and interpretable. In this paper, we demonstrate a property of explanation methods which is disconcerting for both of these purposes. Namely, we show that explanations can be…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
In the study of the arithmetic structure of elliptic modular groups which are the fundamental groups of compactified modular curves, these truncated group algebras and their direct sums are considered to construct elliptic modular motives.…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
We obtain results describing the behavior of the action of rotation generators on polynomials over a commutative ring. We also explore harmonic polynomials in a purely algebraic setting.
The circle method has been successfully used over the last century to study rational points on hypersurfaces. More recently, a version of the method over function fields, combined with spreading out techniques, has led to a range of results…
Time evolution equations for dynamical systems can often be derived from generating functionals. Examples are Newton's equations of motion in classical dynamics which can be generated within the Lagrange or the Hamiltonian formalism. We…
Periodic lattices are natural generalizations of lattices, which arise naturally in diophantine approximations with rationals of bounded denominators. In this paper, we prove analogues of classical theorems in geometry of numbers for…
The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions -- computing the size of projections of high dimensional polytopes…
There are a number of ways to procedurally generate interesting three-dimensional shapes, and a method where a cellular neural network is combined with a mesh growth algorithm is presented here. The aim is to create a shape from a genetic…
Fix a base field F, a finite field K and consider a sequence of central simple F-algebras A_1,...,A_n. In this note we provide some results toward a classification of the indecomposable motives lying in the motivic decompositions of…
We propose a suitable substitute for the classical Grothendieck ring of an algebraically closed field, in which any quasi-projective scheme is represented, while maintaining its non-reduced structure. This yields a more subtle invariant,…
We investigate connections between Lipschitz geometry of real algebraic varieties and properties of their arc spaces. For this purpose we develop motivic integration in the real algebraic set-up. We construct a motivic measure on the space…
We sketch a simplification of proofs of old results on the arithmeticity of the group generated by opposing integral unipotent radicals in higher rank arithmetic groups
We survey over some recent applications of motivic homotopy theory in the definition and the study of $p$-adic cohomology theories. In particular, we revisit the proof of the $p$-adic weight-monodromy conjecture for smooth projective…
The purpose of this note is to verify that the results attained in [6] admit an extension to the multidimensional setting. Namely, for subsets of the two dimensional torus we find the sharp growth rate of the step(s) of a generalized…
In this paper, a geometric interpretation is provided of a new rational Landen transformation. The convergence of its iterates is also established.
Given an operad P with a finite Groebner basis of relations, we study the generating functions for the dimensions of its graded components P(n). Under moderate assumptions on the relations we prove that the exponential generating function…
Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…