English
Related papers

Related papers: Streamlined WZ method proofs of Van Hamme supercon…

200 papers

The usefulness of Gabor frames depends on the easy computability of a suitable dual window. This question is addressed under several aspects: several versions of Schulz's iterative algorithm for the approximation of the canonical dual…

Numerical Analysis · Mathematics 2015-06-24 Tobias Kloos , Joachim Stöckler , Karlheinz Gröchenig

We give a new expression of the multiple harmonic sum, which serves as a refinement of the iterated integral expression of the multiple zeta value, and prove it using the so-called connected sum method. Based on this fact, by taking two…

Number Theory · Mathematics 2024-03-01 Takumi Maesaka , Shin-ichiro Seki , Taiki Watanabe

We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…

Group Theory · Mathematics 2019-05-08 Alla Detinko , Dane Flannery , Alexander Hulpke

In this article, we illustrate how the qualitative phase diagram of a gauge theory coupled to matter can be directly proved and how rigorous numerical bounds may be established. Our work reaffirms the seminal result of Fradkin and Shenker…

Statistical Mechanics · Physics 2009-11-10 Zohar Nussinov

We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…

Combinatorics · Mathematics 2021-11-30 Michael Anastos

The domain of applicability of the Poisson-Lie T-duality is enlarged to include the gauged WZNW models.

High Energy Physics - Theory · Physics 2009-10-31 C. Klimcik , S. Parkhomenko

A novel algorithm for wide-baseline matching called MODS - Matching On Demand with view Synthesis - is presented. The MODS algorithm is experimentally shown to solve a broader range of wide-baseline problems than the state of the art while…

Computer Vision and Pattern Recognition · Computer Science 2016-05-03 Dmytro Mishkin , Jiri Matas , Michal Perdoch

In this paper, a similarity-driven cluster merging method is proposed for unsuper-vised fuzzy clustering. The cluster merging method is used to resolve the problem of cluster validation. Starting with an overspecified number of clusters in…

Machine Learning · Computer Science 2012-07-19 Xuejian Xiong , Kap Chan , Kian Lee Tan

We prove two-term supercongruences for generalizations of recently discovered sporadic sequences of Cooper. We also discuss recent progress and future directions concerning other types of supercongruences.

Number Theory · Mathematics 2021-02-04 Robert Osburn , Brundaban Sahu , Armin Straub

We show that a generalised sparse grid combination technique which combines multi-variate extrapolation of finite difference solutions with the standard combination formula lifts a second order accurate scheme on regular meshes to a fourth…

Numerical Analysis · Mathematics 2026-01-08 Julia Muñoz-Echániz , Christoph Reisinger

We develop an analytical method to prove congruences of the type $$ \sum_{k=0}^{(p^r-1)/d}A_kz^k \equiv \omega(z)\sum_{k=0}^{(p^{r-1}-1)/d}A_kz^{pk} \pmod{p^{mr}\mathbb Z_p[[z]]} \quad \text{for}\; r=1,2,\dots, $$ for primes $p>2$ and fixed…

Number Theory · Mathematics 2020-11-30 Victor J. W. Guo , Wadim Zudilin

We use the Wilf-Zeilberger method to prove identities between Mahler measures of polynomials. In particular, we offer a new proof of a formula due to Lal\'{i}n, and we show how to translate the identity into a formula involving elliptic…

Number Theory · Mathematics 2013-05-09 Jesús Guillera , Mathew Rogers

The problem of measuring similarity of graphs and their nodes is important in a range of practical problems. There is a number of proposed measures, some of them being based on iterative calculation of similarity between two graphs and the…

Artificial Intelligence · Computer Science 2010-09-28 Mladen Nikolic

We systematically investigate the complexity of counting subgraph patterns modulo fixed integers. For example, it is known that the parity of the number of $k$-matchings can be determined in polynomial time by a simple reduction to the…

Computational Complexity · Computer Science 2021-07-02 Radu Curticapean , Holger Dell , Thore Husfeldt

A hypothesis testing algorithm is replicable if, when run on two different samples from the same distribution, it produces the same output with high probability. This notion, defined by by Impagliazzo, Lei, Pitassi, and Sorell [STOC'22],…

Data Structures and Algorithms · Computer Science 2025-09-05 Anders Aamand , Maryam Aliakbarpour , Justin Y. Chen , Shyam Narayanan , Sandeep Silwal

We initiate a program of parameterized proof complexity that aims to provide evidence that FPT is different from W[1]. A similar program already exists for the classes W[2] and W[SAT]. We contrast these programs and prove upper and lower…

Logic in Computer Science · Computer Science 2012-03-26 Barnaby Martin

Wilf-Zeilberger pairs are fundamental in the algorithmic theory of Wilf and Zeilberger for computer-generated proofs of combinatorial identities. Wilf-Zeilberger forms are their high-dimensional generalizations, which can be used for…

Symbolic Computation · Computer Science 2025-06-10 Shaoshi Chen , Christoph Koutschan , Yisen Wang

We present the construction of exactly solvable superconformal field theories describing Type II string models compactified on compact G_2 manifolds. These models are defined by anti-holomorphic quotients of the form (CY*S^1)/Z_2, where we…

High Energy Physics - Theory · Physics 2010-02-03 Ralph Blumenhagen , Volker Braun

In this paper, we propose an overlapping additive Schwarz method for total variation minimization based on a dual formulation. The $O(1/n)$-energy convergence of the proposed method is proven, where $n$ is the number of iterations. In…

Numerical Analysis · Mathematics 2021-02-05 Jongho Park

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2017-04-21 Zhi-Wei Sun
‹ Prev 1 4 5 6 7 8 10 Next ›