English
Related papers

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

200 papers

We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier…

Quantum Algebra · Mathematics 2007-05-23 Andrei Okounkov

We prove a general combination theorem for discrete subgroups of $\mathrm{PGL}(n,\mathbb{R})$ preserving properly convex open subsets in the projective space $\mathbb{P}(\mathbb{R}^n)$, in the spirit of Klein and Maskit. We use it in…

Group Theory · Mathematics 2025-06-24 Jeffrey Danciger , François Guéritaud , Fanny Kassel

We establish a version of the Beurling-Pollard theorem for operator synthesis and apply it to derive some results on linear operator equations and to prove a Beurling-Pollard type theorem for Varopoulos tensor algebras. Additionally we…

Functional Analysis · Mathematics 2007-05-23 Victor Shulman , Lyudmila Turowska

We present a relative form of the Toponogov comparison theorem.

Differential Geometry · Mathematics 2023-05-24 Jianming Wan

We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a…

Combinatorics · Mathematics 2018-10-16 Garner Cochran , Corbin Groothuis , Andrew Herring , Ranjan Rohatgi , Eric Stucky

A proof of Sendov's conjecture is given.

Complex Variables · Mathematics 2007-05-23 Gerald Schmieder

We give an algebraic proof for a theorem of Mislin in the case of cohomology of saturated fusion systems defined on p-groups when p is odd. Some applications of this theorem to block algebras of finite groups are also given.

Representation Theory · Mathematics 2014-12-11 C. C. Todea

Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…

Combinatorics · Mathematics 2025-07-21 Eli R. DeWitt , William J. Keith

In a recent preprint, Gullerud and Walker [2] proved a theorem and made a conjecture about the correctness of efficiently generating B\'ezout trees for Pythagorean pairs. In this note, we give a simple proof of their theorem, confirm that…

Number Theory · Mathematics 2018-04-03 Cherng-tiao Perng , Maila Brucal-Hallare

We give a new proof of Brooks' theorem that immediately implies a strengthening of Brooks' theorem, known as Catlin's theorem.

Combinatorics · Mathematics 2014-10-29 Vaidy Sivaraman

In the present article, we introduce a unified notion of multi-tupled fixed points and utilize the same to prove some existence and uniqueness unified multi-tupled fixed point theorems for Boyd-Wong type nonlinear contractions satisfying…

Functional Analysis · Mathematics 2016-01-12 Aftab Alam , Mohammad Imdad , Javid Ali

We state and prove a new closure theorem closely related to the classical closure theorems of Poncelet and Steiner. Along the way, we establish a number of theorems concerning conic sections.

Metric Geometry · Mathematics 2013-10-15 Nikolai Beluhov

We prove a duality theorem for Cohen--Macaulay simplicial complexes. This is a generalisation of Poincar\'e Duality, framed in the language of combinatorial sheaves. Our treatment is self-contained and accessible for readers with a working…

Algebraic Topology · Mathematics 2025-02-07 Richard D. Wade , Thomas A. Wasserman

We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.

Combinatorics · Mathematics 2014-11-26 Daniel K. Du , Qing-Hu Hou , Charles B. Mei

We establish a number of "concatenation theorems" that assert, roughly speaking, that if a function exhibits "polynomial" (or "Gowers anti-uniform", "uniformly almost periodic", or "nilsequence") behaviour in two different directions…

Combinatorics · Mathematics 2017-01-18 Terence Tao , Tamar Ziegler

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

Combinatorics · Mathematics 2013-12-04 Andrew V. Sills

A complete p-adic Khintchine type theorem for approximation by p-adic algebraic numbers is established.

Number Theory · Mathematics 2008-02-15 Victor Beresnevich , Vasili Bernik , Ella Kovalevskaya

Binomial Theorem for (N+n)^r is described with non-commuting variables N and n.

Combinatorics · Mathematics 2011-12-23 Moa Apagodu , Patrick Gaskill , Shalosh B. Ekhad

We prove a uniform vector-valued Wiener-Wintner Theorem for a class of operators that includes compositions of ergodic Koopman operators with contractive multiplication operators. Our results are new even in the case of complex-valued…

Functional Analysis · Mathematics 2025-03-20 Micky Barthmann , Sohail Farhangi

In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins

General Mathematics · Mathematics 2016-09-16 S. N. Baibekov , A. A. Durmagambetov
‹ Prev 1 4 5 6 7 8 10 Next ›