Related papers: A Combination Theorem for PD(n)-Pairs

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

We prove the Kodaira vanishing theorem for log-canonical and semi-log-canonical pairs. We also give a relative vanishing theorem of Reid--Fukuda type for semi-log-canonical pairs.

Let $(\mathcal{A}, \mathcal{B}, \mathcal{C})$ be a recollement of extriangulated categories.In this paper, we first show how to obtain an $n$-cotorsion pair in $\mathcal{B}$ from given $n$-cotorsion pairs in $\mathcal{A}$ and $\mathcal{C}$.…

We determine the pair correlations of countable sets $T \subset \mathbb{R}^n$ satisfying natural equidistribution conditions. The pair correlations are computed as the volume of a certain region in $\mathbb{R}^{2n}$, which can be expressed…

In this article, we prove a decomposition theorem on differential polynomials of theta functions of high level.

It will be shown that Pascal's Theorem is equivalent to the associativity of a natural binary operation on conic sections. A novel proof for Pascal's Theorem will then be given by showing that this binary operation is associative…

We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli space. We apply this method to disqualify three real examples…

In this paper, we prove Newton-Maclaurin type inequalities for functions obtained by linear combination of two neighboring primary symmetry functions, which is a generalization of the classical Newton-Maclaurin inequality.

We prove an analogue of the prime number theorem for finite fields.

We prove a connectedness result for products of weighted projective spaces.

We prove a conjecture of Adamaszek generalizing the seating couples problem to the case of $2n$ seats. Concretely, we prove that given a positive integer $n$ and $d_1,\ldots,d_n\in(\mathbb{Z}/2n)^*$ we can partition $\mathbb{Z}/2n$ into $n$…

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…

We give a counting based proof of the Graham Pollak Theorem

Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…

We prove a version for random measures of the celebrated Kantorovich-Rubinstein duality theorem and we give an application to the coupling of random variables which extends and unifies known results.

In this paper we prove some interpolation theorems for the multipliers of the Cauchy- Stiltjes type integrals

An technically interesting proof of a known theorem.

Andrews and Simay showed that parity palindrome compositions have a surprisingly simple formula. We give a recursive proof.

We establish a coupled fixed points theorem for a meaningful class of mixed monotone multivalued operators and then we use it to derive some results on existence of quasisolutions and solutions to first--order functional differential…