English
Related papers

Related papers: The weighted hook-length formula II: Complementary…

200 papers

In his paper from 1996 on quadratic forms Heath-Brown developed a version of the circle method to count points in the intersection of an unbounded quadric with a lattice of short period, if each point is given a weight, and approximated…

Number Theory · Mathematics 2023-04-07 Andrey Dymov , Sergei Kuksin , Alberto Maiocchi , Sergei Vladuts

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

We analyze a system of linear algebraic equations whose solutions lead to a proof of a generalization of Boole's formula. In particular, our approach provides an elementary and short alternative to Katsuura's proof of this generalization.

Combinatorics · Mathematics 2024-05-27 Haoran Zhu

We present a rooted hypersequent calculus for modal propositional logic S5. We show that all rules of this calculus are invertible and that the rules of weakening, contraction, and cut are admissible. Soundness and completeness are…

Logic · Mathematics 2019-05-23 Mojtaba Aghaei , Hamzeh Mohammadi

Let $T_n$ denote the binary tree of depth $n$ augmented by an extra edge connected to its root. Let $C_n$ denote the cover time of $T_n$ by simple random walk. We prove that $\sqrt{ \mathcal{C}_{n} 2^{-(n+1) } } - m_n$ converges in…

Probability · Mathematics 2019-06-19 Amir Dembo , Jay Rosen , Ofer Zeitouni

In this paper, we continue the study of linear sets with complementary weights. We find criteria to determine the set of points of any fixed weight and use this to present particular linear sets with few points of weight more than one. We…

Combinatorics · Mathematics 2025-11-26 Geertrui Van de Voorde , Ferdinando Zullo

We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge…

Geometric Topology · Mathematics 2023-04-05 Sebastian Baader , Ryan Blair , Alexandra Kjuchukova , Filip Misev

We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…

Complex Variables · Mathematics 2022-09-15 Abhijit Banerjee , Bikash Chakraborty

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight…

Geometric Topology · Mathematics 2007-05-23 Stavros Garoufalidis , Martin Loebl

We present a bijective proof of the hook-length formula for shifted standard tableaux of a fixed shape based on a modified jeu de taquin and the ideas of the bijective proof of the hook-length formula for ordinary standard tableaux by…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer

We use Taylor's formula with Lagrange remainder to prove that functions with bounded second derivative are rectifiable in the case when polygonal paths are defined by interval subdivisions which are equally spaced. We discuss potential…

History and Overview · Mathematics 2019-04-16 Patrik Nystedt

The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…

Probability · Mathematics 2009-09-29 Vlada Limic , Pierre Tarrès

In this article, we extend the integration by parts formulae for the laws of Bessel bridges obtained in previous work with Zambotti, by showing that these formulae hold for very general test functionals on $L^{2}(0,1)$. A key step consists…

Probability · Mathematics 2022-04-11 Henri Elad Altman

We derive a generalized Stokes' theorem, valid in any dimension and for arbitrary loops, even if self intersecting or knotted. The generalized theorem does not involve an auxiliary surface, but inherits a higher rank gauge symmetry from the…

High Energy Physics - Theory · Physics 2008-02-03 N. Bralic

We show that there exists an ergodic conductance environment such that the weak (annealed) invariance principle holds for the corresponding continuous time random walk but the quenched invariance principle does not hold. In the present…

Probability · Mathematics 2013-12-17 Martin Barlow , Krzysztof Burdzy , Adám Timár

We present a construction for complementary pairs of arrays that exploits a set of mutually-unbiased bases, and enumerate these arrays as well as the corresponding set of complementary sequences obtained from the arrays by projection. We…

Information Theory · Computer Science 2013-12-05 Gaofei Wu , Matthew G. Parker

The purpose of this paper is to develop and study recursive proofs of coinductive predicates. Such recursive proofs allow one to discover proof goals in the construction of a proof of a coinductive predicate, while still allowing the use of…

Logic in Computer Science · Computer Science 2018-02-21 Henning Basold

A formula for factorizations of the full twist in the braid group $Br_{2m}$ depending on any four factorizations of the full twist in $Br_{m}$ is given. Applying this formula, a symplectic 4-manifold $X$ and two isotopic generic coverings…

Algebraic Geometry · Mathematics 2007-05-23 Vik. S. Kulikov

We establish endoscopic and stable trace formulas whose discrete spectral terms are weighted by automorphic $L$-functions, by the use of basic functions that are incorporated into the global spectral and geometric coefficients. This is a…

Representation Theory · Mathematics 2022-04-18 Tian An Wong

In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.

Discrete Mathematics · Computer Science 2025-10-06 Gopalan Sajith , Sanjeev Saxena