Related papers: Counting Square free Cremona monomial maps

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

We classify rational cuspidal curves of degrees 6 and 7 in the complex projective plane, up to symplectic isotopy. The proof uses topological tools, pseudoholomorphic techniques, and birational transformations.

We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.

We develop several combinatorial models that are useful in the study of the $SL_n$-variety $\mathcal{X}$ of complete quadrics. Barred permutations parameterize the fixed points of the action of a maximal torus $T$ of $SL_n$, while…

This note gives the complete projective classification of rational, cuspidal plane curves of degree at least 6, and having only weighted homogeneous singularities. It also sheds new light on some previous characterizations of free and…

A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological…

We consider words $w$ over the alphabet $\Sigma=\{0,1,2\}$. It is shown that there are irreducibly square-free words of all lengths $n$ except 4,5,7 and 12. Such a word is square-free (i.e., it has no repetitions $uu$ as factors), but by…

We wish to construct a minimal set of algebraically independent scalar curvature invariants formed by the contraction of the Riemann (Ricci) tensor and its covariant derivatives up to some order of differentiation in three dimensional (3D)…

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…

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 image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

For non-singular intersections of pairs of quadrics in 11 or more variables, we prove an asymptotic for the number of rational points in an expanding box.

Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…

We perform dynamical QCD simulations with $n_f=2$ overlap fermions by hybrid Monte-Carlo method on $6^4$ to $8^3\times 16$ lattices. We study the problem of topological sector changing. A new method is proposed which works without…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

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…

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

Let K be a field and S a polynomial ring in a finite number of variables over K. Let F be a finitely generated graded free S-module. We examine some classes of squarefree monomial submodules of F. Hence, we focalize our attention on the…