Related papers: Counting square free monomial cremona maps
We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from…
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…
Veneroni maps are a class of birational transformations of projective spaces. This class contains the classical Cremona transformation of the plane, the cubo-cubic transformation of the space and the quatro-quartic transformation of…
We construct uncountably many finitely generated, pairwise non-isomorphic torsion-free groups, all of which fall into the same quasi-isometry class. This is done by considering Schur covering groups and group cohomology, with the necessary…
We find all quadratic post-critically finite (PCF) rational maps defined over the rationals. We describe an algorithm to search for possibly PCF maps. Using the algorithm, we eliminate all but twelve rational maps, all of which are…
We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over $\mathbb{Q}(\sqrt{d})$ where $d$ is a square-free…
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 propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results to find prescribed quadratic subfields of quaternion…
We construct invariants of birational maps with values in the Kontsevich--Tschinkel group and in the truncated Grothendieck groups of varieties. These invariants are morphisms of groupoids and are well-suited to investigating the structure…
We give asymptotics for correlation sums linked with the distribution of squarefree numbers in arithmetic progressions over a fixed modulus. As a particular case we improve a result of Blomer concerning the variance.
We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…
The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.
In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over $\F_{q^r}$. In addition, we present a class of complete permutation multinomials, which…
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…
For important classes of many-fermion problems, quantum Monte Carlo (QMC) methods allow exact calculations of ground-state and finite-temperature properties, without the sign problem. The list spans condensed matter, nuclear physics, and…
We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…
Two infinite families of Cremona maps depending on one real parameter are given. For all integers $n \ge 1$ the first family of Cremona maps consists of group elements in $Bir \left( \mathbb{P}^{n} \right)$ with bidegree $(n, n)$, the…
This article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…
We study irreducible surfaces of degree d in $\mathbb{P}^3$ that contain a line of multiplicity d-1 (monoidal surfaces) or d-2 (submonoidal surfaces). We relate them to congruences of lines and Cremona transformations. Many of our results…
Let $\theta(n)$ denote the number of permutations of $\{1,2,\ldots,n\}$ that do not contain a 3-term arithmetic progression as a subsequence. Such permutations are known as 3-free permutations. We present a dynamic programming algorithm to…