Related papers: Counting lattice triangulations: Fredholm equation…

We apply lattice point counting methods to compute the multiplicities in the plethysm of $GL(n)$. Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old…

Lacunary function systems of type $(f(M_nx))_{n\geq 1}$ for periodic functions $f$ and sequences of fast-growing matrices $(M_n)_{n\geq 1}$ exhibit many properties of independent random variables like satisfying the Central Limit Theorem or…

We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infinite family of triangulations that requires this many flips…

Let $m,n\ge 2$, $m\le n$. It is well-known that the number of (two-dimensional) threshold functions on an $m\times n$ rectangular grid is {eqnarray*} t(m,n)=\frac{6}{\pi^2}(mn)^2+O(m^2n\log{n})+O(mn^2\log{\log{n}})=…

For an arrangement of $n$ lines in the real projective plane, we denote by $f$ the number of regions into which the real projective plane is divided by the lines. Using Bojanowski's inequality, we establish a new lower bound for $f$. In…

In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4,6,12) and (3^4,6) lattices using the linearity approximation described in (Scullard and Ziff, J. Stat. Mech. P03021), implemented as a…

We study multivariate numerical integration of smooth functions in weighted Sobolev spaces with dominating mixed smoothness $\alpha\geq 2$ defined over the $s$-dimensional unit cube. We propose a new quasi-Monte Carlo (QMC)-based quadrature…

We prove the exponent $4/3$ for the lattice point discrepancy of a torus in $\mathbb{R}^3$ (generated by the rotation of a circle around the $z$ axis). The exponent comes from a diagonal term and it seems a natural limit for any approach…

We compute a minimum degree threshold sufficient for 3-partite graphs to admit a fractional triangle decomposition. Together with recent work of Barber, K\"uhn, Lo, Osthus and Taylor, this leads to bounds for exact decompositions and in…

Three-dimensional three-colour percolation on a lattice made of tetrahedra is a direct generalization of two-dimensional two-colour percolation on the triangular lattice. The interfaces between one-colour clusters are made of bicolour…

We describe a technique to analytically compute the multipole moments of a charge distribution confined to a planar triangle, which may be useful in solving the Laplace equation using the fast multipole boundary element method (FMBEM) and…

For a projective hyperplane arrangement, we study sufficient conditions in terms of combinatorial data for ESV-calculability of the monodromy eigenspaces of the first Milnor fiber cohomology for eigenvalues of order $m>1$. This can be…

The parametric lattice-point counting problem is as follows: Given an integer matrix $A \in Z^{m \times n}$, compute an explicit formula parameterized by $b \in R^m$ that determines the number of integer points in the polyhedron $\{x \in…

A recent result of Eden, Levi, and Ron (ECCC 2015) provides a sublinear time algorithm to estimate the number of triangles in a graph. Given an undirected graph $G$, one can query the degree of a vertex, the existence of an edge between…

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

The convolution sum, $\underset{\substack{ {(l,m)\in\mathbb{N}_{0}^{2}} {\alpha\,l+\beta\,m=n} } }{\sum}\sigma(l)\sigma(m)$, where $\alpha\beta=44,52$, is evaluated for all natural numbers $n$. We then use these convolution sums to…

Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list…

We deal with lattices that are generated by the Vandermonde matrices associated to the roots of Chebyshev-polynomials. If the dimension $d$ of the lattice is a power of two, i.e. $d=2^m, m \in \mathbb{N}$, the resulting lattice is an…

A numerically efficient Fredholm formulation of the billiard problem is presented. The standard solution in the framework of the boundary integral method in terms of a search for roots of a secular determinant is reviewed first. We next…

In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…