Related papers: Counting square free monomial cremona maps
A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal…
We present a fast enumeration algorithm for combinatorial 2- and 3-manifolds. In particular, we enumerate all triangulated surfaces with 11 and 12 vertices and all triangulated 3-manifolds with 11 vertices. We further determine all…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…
A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A permutation is bicrucial with respect to squares if it is square-free but any extension of it to the right or to…
Computing the autotopism group of a partial Latin rectangle can be performed in a variety of ways. This pilot study has two aims: (a) to compare these methods experimentally, and (b) to identify the design goals one should have in mind for…
The goal of this paper is to count the number of distinct functions of n variables, up to permutation of the variables, that can be constructed using each variable exactly once, without constants, using only the operations of addition,…
The estimation of large covariance matrices has a high dimensional bias. Correcting for this bias can be reformulated via the tool of Free Probability Theory as a free deconvolution. The goal of this work is a computational and statistical…
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 consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
We compute Gromov-Witten invariants of any genus for del Pezzo surfaces of degree $\ge2$. The genus zero invariants have been computed a long ago, Gromov-Witten invariants of any genus for del Pezzo surfaces of degree $\ge3$ have been found…
In this work we present a new polynomial map $f:=(f_1,f_2):{\mathbb R}^2\to{\mathbb R}^2$ whose image is the open quadrant $\{x>0,y>0\}\subset{\mathbb R}^2$. The proof of this fact involves arguments of topological nature that avoid hard…
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…
This paper discusses to what extent the census of multiplicity-free fusion categories up to rank 7, proposed by the software package Anyonica and the anyonwiki website, can be regarded as a proper classification. The questions of…
We compute the local Gromov-Witten invariants of the "closed vertex", that is, a configuration of three rational curves meeting in a single triple point in a Calabi-Yau threefold. The method is to express the local invariants of the vertex…
For polynomials of degree two which have no zeros, the method of accompanying variables is developed and zeros of associated vector polynomials are determined. Our flexible method uses a wide variety of possible vector-valued vector…
A novel class of derivative-free optimization algorithms is developed. The main idea is to utilize certain non-commutative maps in order to approximate the gradient of the objective function. Convergence properties of the novel algorithms…
We study the linear span of commutators of free random variables and show that these are the only quadratic forms which satisfy the following equivalent properties: * preservation free infinite divisibility * free and strong cancellation of…
We consider the set $\mathcal M_n\left(\mathbb Z; H\right)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain and asymptotic formula on the number of matrices from $\mathcal M_n\left(\mathbb Z; H\right)$ with…