Related papers: Counting Square free Cremona monomial maps

Interferometric closure invariants encode calibration-independent details of an object's morphology. Excepting simple cases, a direct backward transformation from closure invariants to morphologies is not well established. We demonstrate…

Using a filtration on the Grothendieck ring of triangulated categories, we define the categorical dimension of a birational map between smooth projective varieties. We show that birational automorphisms of bounded categorical dimension form…

Masses of fermions in the SO(10) 16-plet are constructed using only the 10, 120 and 126 scalar multiplets. The mass matrices are restricted to be hermitian and the theory is constructed to have certain assumed quark masses, charged lepton…

The toric code is known to be equivalent to free fermions. This paper presents explicit local unitary transformations that map the $\mathbb{Z}_2$ toric and surface code --- the open boundary equivalent of the toric code --- to fermions.…

We present several results on counting untyped lambda terms, i.e., on telling how many terms belong to such or such class, according to the size of the terms and/or to the number of free variables.

We give practical numerical methods to compute the period matrix of a plane algebraic curve (not necessarily smooth). We show how automorphisms and isomorphisms of such curves, as well as the decomposition of their Jacobians up to isogeny,…

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…

Quadratization is a transform of a system of ODEs with polynomial right-hand side into a system of ODEs with at most quadratic right-hand side via the introduction of new variables. It has been recently used as a pre-processing step for new…

Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…

Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…

This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…

Given f in Z[x_1,...,x_n], we compute the density of x in Z^n such that f(x) is squarefree, assuming the abc conjecture. Given f,g in Z[x_1,...,x_n], we compute unconditionally the density of x in Z^n such that gcd(f(x),g(x))=1. Function…

We classify all possible automorphism groups of smooth cubic surfaces over an algebraically closed field of arbitrary characteristic. As an intermediate step we also classify automorphism groups of quartic del Pezzo surfaces. We show that…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

String diagrams can nicely express numerous computations in symmetric strict monoidal categories (SSMC). To be entirely exact, this is only true for props: the SSMCs whose monoid of objects are free. In this paper, we show a propification…

We give a construction of completely integrable 4-dimensional Hamiltonian systems with cubic Hamilton functions. Applying to the corresponding pairs of commuting quadratic Hamiltonian vector fields the so called Kahan-Hirota-Kimura…

A smooth cuboid can be identified with a $3\times 3$ matrix of linear forms, with coefficients in a field $K$, whose determinant describes a smooth cubic in the projective plane. To each such matrix one can associate a group scheme over…

Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…

Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve…

We prove that any group of cardinality at most the one of $\mathbb{C}$ is a quotient of any Cremona group of rank at least $4$. This provides a definitive answer to the question of what the quotients of Cremona groups can be. As a…