Related papers: Counting square free monomial cremona maps
We use combinatorics tools to reobtain the classification of monomial quadratic Cremona transformations in any number of variables given in \cite{SV2} and to classify and count square free cubic Cremona maps with at most six variables, up…
We give a method for constructing many examples of automorphisms with positive entropy on rational complex surfaces. The general idea is to begin with a quadratic Cremona transformation that fixes a reduced cubic curve and then use the…
One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of…
We give algorithms of computing bases of logarithmic cohomology groups for square-free polynomials in two variables. (Fixed typos of v1)
We classify all monomial planar Cremona maps by multidegree using recent methods developed by Aluffi. Following the main result, we prove several more properties of the set of these maps, and also extend the results to the more general…
In this paper, we show that Cremona groups are sofic. We actually introduce a quantitative notion of soficity, called sofic profile, and show that the group of birational transformations of a d-dimensional variety has sofic profile at most…
A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A square-free permutation of length $n$ is $P$-crucial, where $P$ is a subset of $\{0,1,\ldots,n\}$, if any of its…
Two birational subvarieties of P^n are called Cremona equivalent if there is a Cremona modification of P^n mapping one to the other. If the codimension of the varieties is at least 2 then they are always Cremona Equivalent. For divisors the…
A square is a factor $S = (S_1; S_2)$ where $S_1$ and $S_2$ have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if every extension to the…
We compute the multidegrees and the Segre numbers of general determinantal Cremona transformations, with generically reduced base scheme, by specializing to the standard Cremona transformation and computing its Segre class via mixed volumes…
Two divisors in $\P^n$ are said to be Cremona equivalent if there is a Cremona modification sending one to the other. We produce infinitely many non equivalent divisorial embeddings of any variety of dimension at most 14. Then we study the…
One defines two ways of constructing rational maps derived from other rational maps, in a characteristic-free context. The first introduces the Newton complementary dual of a rational map. One main result is that this dual preserves…
We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…
Cremona maps defined by monomials of degree 2 are thoroughly analyzed and classified via integer arithmetic and graph combinatorics. In particular, the structure of the inverse map to such a monomial Cremona map is made very explicit as is…
Given two finite sequences of positive integers $\alpha$ and $\beta$, we associate a square free monomial ideal $I_{\alpha,\beta}$ in a ring of polynomials $S$, and we recursively compute the algebraic invariants of $S/I_{\alpha,\beta}$.…
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.
I discuss a simple numerical algorithm for the direct evaluation of multiple Grassmann integrals. The approach is exact, suffers no Fermion sign problems, and allows arbitrarily complicated interactions. Memory requirements grow…
In this paper we address the following question arising from the work of P. Etingof, D. Kazhdan and A. Polishchuk (math.AG/0003009): given a homogeneous complex polynomial, when the rational map defined by its partials is of degree 1? We…
We express the multigraded Betti numbers of monomial ideals in 4 variables in terms of the multigraded Betti numbers of 66 squarefree monomial ideals, also in 4 variables. We use this class of 66 ideals to prove that monomial resolutions in…
In this paper we present an effective method for linearizing rational varieties of codimension at least two under Cremona transformations, starting from a given parametrization. Using these linearizing Cremonas, we simplify the equations of…