English
Related papers

Related papers: Where Pigeonhole Principles meet K\"onig Lemmas

200 papers

We prove conservativity results for weak K\H{o}nig's lemma that extend the celebrated result of Harrington (for $\Pi^1_1$-statements) and are somewhat orthogonal to the extension by Simpson, Tanaka and Yamazaki (for statements of the form…

Logic · Mathematics 2024-12-19 Anton Freund , Patrick Uftring

We study the extreme local structure of plane binary trees through the distribution of leaves at maximum depth. We first address two basic questions: (i) the asymptotic probability that exactly two leaves occur at the deepest level, and…

Combinatorics · Mathematics 2026-05-14 Olivier Bodini , Antoine Genitrini , Khaydar Nurligareev

Given a set $X$ of species, a phylogenetic tree is an unrooted binary tree whose leaves are bijectively labelled by $X$. Such trees can be used to show the way species evolve over time. One way of understanding how topologically different…

Populations and Evolution · Quantitative Biology 2023-09-01 Steven Kelk , Ruben Meuwese

We introduce $L^2_{K,P}$, a monadic second-order language for reasoning about trees which characterizes the strongly Context-Free Languages in the sense that a set of finite trees is definable in $L^2_{K,P}$ iff it is (modulo a projection)…

cmp-lg · Computer Science 2008-02-03 James Rogers

We address a number of puzzles relating to the proposed formulae for the degeneracies of dyons in orbifold compactifications of the heterotic string to four dimensions with $N =4$ supersymmetry. The partition function for these dyons is…

High Energy Physics - Theory · Physics 2008-11-26 Atish Dabholkar , Davide Gaiotto , Suresh Nampuri

The minimization principle $\textsf{MIN}(\triangleleft)$ studied in bounded arithmetic says that a strict linear ordering $\triangleleft$ on any finite interval $[0,\dots,n)$ has the minimal element. We shall prove that bounded arithmetic…

Logic · Mathematics 2026-05-18 Mykyta Narusevych

We point out that a sizable strong phase could be generated from the penguin annihilation in the soft-collinear effective theory for B meson decays. Keeping a small scale suppressed by O(Lambda/m_b), Lambda being a hadronic scale and m_b…

High Energy Physics - Phenomenology · Physics 2008-11-26 Junegone Chay , Hsiang-nan Li , Satoshi Mishima

Let R = D[x;\sigma;\delta] be an Ore extension over a commutative Dedekind domain D, where \sigma is an automorphism on D. In the case \delta = 0 Marubayashi et. al. already investigated the class of minimal prime ideals in term of their…

Rings and Algebras · Mathematics 2010-02-02 Amir Kamal Amir , Pudji Astuti , Intan Muchtadi-Alamsyah

Haken proved that every resolution refutation of the pigeonhole formula has at least exponential size. Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has an exponential size. Here we show that any…

Computational Complexity · Computer Science 2009-09-29 Olga Tveretina , Carsten Sinz , Hans Zantema

In this paper, we introduce tree varieties as a natural generalization of products of partial flag varieties. We study orbits of the PGL action on tree varieties. We characterize tree varieties with finitely many PGL orbits, generalizing a…

Algebraic Geometry · Mathematics 2023-07-19 Izzet Coskun , Demir Eken , Chris Yun

We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that…

Data Structures and Algorithms · Computer Science 2007-05-23 Noga Alon , Fedor Fomin , Gregory Gutin , Michael Krivelevich , Saket Saurabh

Classically, the splitting principle says how to pull back a vector bundle in such a way that it splits into line bundles and the pullback map induces an injection on $K$-theory. Here we categorify the splitting principle and generalize it…

Category Theory · Mathematics 2024-10-10 John C. Baez , Joe Moeller , Todd Trimble

In this paper we introduce sigma limits (which we write $\sigma$-limits), a concept that interpolates between lax and pseudolimits: for a fixed family $\Sigma$ of arrows of a 2-category $\mathcal{A}$, a $\sigma$-cone for a $2$-functor…

Category Theory · Mathematics 2018-05-22 M. E. Descotte , E. J. Dubuc , M. Szyld

In [Kim05], Kim gave a new proof of Siegel's Theorem that there are only finitely many $S$-integral points on $\mathbb P^1_{\mathbb Z}\setminus\{0,1,\infty\}$. One advantage of Kim's method is that it in principle allows one to actually…

This is a sequel to my paper "The Octagonal PET I: Renormalization and Hyperbolic Symmetry". In this paper we use the renormalization scheme found in the first paper to classify the limit sets of the systems according to their topology. The…

Dynamical Systems · Mathematics 2012-10-02 Richard Evan Schwartz

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

Quantum Physics · Physics 2023-03-15 Nikhil S. Mande , Justin Thaler , Shuchen Zhu

Based on a pair of cohomology operations on so called $\delta-2$-formal spaces, we construct the integral cohomology rings of the classifying spaces of the Lie groups $Spin(n)$ and $Spin^{c}(n)$. As applications, we introduce characteristic…

Algebraic Topology · Mathematics 2019-07-04 Haibao Duan

Building on prior work, we analyze the decomposition of the restriction of an irreducible representation of SL_2(k), for k a p-adic field of odd residual characteristic, to a maximal compact subgroup K. The pattern of the decomposition…

Representation Theory · Mathematics 2012-06-05 Monica Nevins

Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…

Methodology · Statistics 2010-11-23 Matthew A. Taddy , Robert B. Gramacy , Nicholas G. Polson

Classification trees continue to be widely adopted in machine learning applications due to their inherently interpretable nature and scalability. We propose a rolling subtree lookahead algorithm that combines the relative scalability of the…

Machine Learning · Computer Science 2023-04-24 Zeynel Batuhan Organ , Enis Kayış , Taghi Khaniyev
‹ Prev 1 8 9 10 Next ›