相关论文: A solution to the tennis ball problem

The ability to automatically generalise (interactive) proofs and use such generalisations to discharge related conjectures is a very hard problem which remains unsolved. Here, we develop a notion of goal types to capture key properties of…

In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

We develop a systematic way to solve linear equations involving tensors of arbitrary rank. We start off with the case of a rank $3$ tensor, which appears in many applications, and after finding the condition for a unique solution we derive…

We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…

In this paper, we use techniques of enumerative combinatorics to study the following problem: we count the number of ways to split $n$ balls into nonempty, ordered bins so that the most crowded bin has exactly $k$ balls. We find closed…

We investigate the two-dimensional elastostatic inclusion problem in an unbounded medium. Building on the recent developments for rigid inclusions \cite{Mattei:2021:EAS} and conductivity inclusions \cite{Jung:2021:SEL}, we extend these…

We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…

Simulating thimble regularization of lattice field theory can be tricky when more than one thimble is to be taken into account. A couple of years ago we proposed a solution for this problem. More recently this solution proved to be…

A star of n (n greater than or equal to 2) line segments (needles) of equal length with common endpoint and constant angular spacing is randomly placed onto a lattice which is the union of two families of equidistant lines in the plane with…

Let M(n,k,r,s) be the number of ordered paths in the plane, with unit steps E or N, that intersect k times in which the first path ends at the point (r,n-r) and the second path ends at the point (s,n-s). Our main object of study in this…

This paper presents an algorithm for computing the contraction of two-dimensional tensor networks on a square lattice; and we combine it with solving congruence equations to compute the exact enumeration (including weighted enumeration) of…

Numerous problems of analysis (real and complex) and geometry (analytic, algebraic, Diophantine e.a.) can be reduced to calculation of the ``number of solutions'' of systems of equations, defined by algebraic equalities and differential…

Quantum systems on a one-dimensional lattice are ubiquitous in the study of models exactly-solved by Bethe Ansatz techniques. Here it is shown that including global-range interaction opens scope for Bethe Ansatz solutions that are not…

We introduce a new type of lattice path, called brick-wall lattice path, and we derive a formula which counts the number of paths on these lattices imposing certain restrictions on the Cartesian plane. Connections to the Fibonacci sequence,…

How many ways are there to climb a staircase in a given number of steps? Infinitely many, if we focus on the continuous aspect of the problem. A finite, possibly large number if we consider the discrete aspect, \emph{i.e.} on which surface…

Consider an $m\times n$ table $T$ and latices paths $\nu_1,\ldots,\nu_k$ in $T$ such that each step $\nu_{i+1}-\nu_i=(1,1)$, $(1,0)$ or $(1,-1)$. The number of paths from the $(1,i)$-blank (resp. first column) to the $(s,t)$-blank is…

We show that the 4-variable generating function of certain orientation related parameters of an ordered oriented matroid is the evaluation at (x + u, y+v) of its Tutte polynomial. This evaluation contains as special cases the counting of…

We study enumerations of Dyck and ballot tilings, which are tilings of a region determined by two Dyck or ballot paths. We give bijective proofs to two formulae of enumerations of Dyck tilings through Hermite histories. We show that one of…

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…