Related papers: Counting Square free Cremona monomial maps
To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…
A method is developed to compute analytically fully symmetric cubature rules on the triangle by using symmetric polynomials to express the two kinds of invariance inherent in these rules. Rules of degree up to 15, some of them new and of…
We study the asymptotics of the average number of squares (or quadratic residues) in Z_n and Z_n^*. Similar analyses are performed for cubes, square roots of 0 and 1, and cube roots of 0 and 1.
Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…
In an attempt to classify all of the overlap-free morphisms constructively using the Latin-square morphism, we came across an interesting counterexample, the Leech square-free morphism. We generalize the combinatorial properties of the…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…
Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…
We present a method for computing all the symmetries of a rational ruled surface defined by a rational parametrization which works directly in parametric rational form, i.e. without computing or making use of the implicit equation of the…
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…
We develop an algorithm to count the number of virtual Fourier-Mukai partners for a given cubic fourfold, with initial input the primitive algebraic lattice and transcendental Hodge structure. Under some mild assumptions, we prove that our…
We show that even dimensional Fermat cubic hypersurfaces are rational over any field of characteristic different from three by producing explicit rational parametrizations given by polynomials of low degree. As a byproduct of our…
Using a Quot scheme compactification, we calculate the virtual count of maps of degree $d$ from a smooth projective curve of genus $g$ to a hypersurface in a Grassmannian, sending specified points of the curve to special Schubert…
Two reduced projective schemes are said to be Cremona equivalent if there is a Cremona map that maps one in the other. In this paper I revise some of the known results about Cremona equivalence and extend the main result of [MP09] to…
We prove an asymptotic formula for the number of representations of squares by nonsingular cubic forms in six or more variables. The main ingredients of the proof are Heath-Brown's form of the Circle Method and various exponential sum…
We derive a rigorous, quantum mechanical map of fermionic creation and annihilation operators to continuous Cartesian variables that exactly reproduces the matrix structure of the many-fermion problem. We show how our scheme can be used to…
We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…
To accelerate the HMC with field transformation, we consider a variant of the trivializing map, the decimation map, which can be regarded as a coarse-graining transformation. Using the 2D $U(1)$ pure gauge model, combined with the guided…
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.
We count certain abelian surfaces with potential quaternionic multiplication defined over a number field $K$ by counting points of bounded height on some genus zero Shimura curves.
In this paper, we propose integrable discretizations of a two-dimensional Hamiltonian system with quartic potentials. Using either the method of separation of variables or the method based on bilinear forms, we construct the corresponding…