相关论文: The weak pigeonhole principle for function classes…

We prove, under a computational complexity hypothesis, that it is consistent with the true universal theory of p-time algorithms that a specific p-time function extending $n$ bits to $m \geq n^2$ bits violates the dual weak pigeonhole…

We give elementary proof that theory $T^1_2(R)$ augmented by the weak pigeonhole principle for all $\Delta^b_1(R)$-definable relations does not prove the bijective pigeonhole principle for $R$. This can be derived from known more general…

Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with $n$ holes and any…

The infinite pigeonhole principle for 2-partitions ($\mathsf{RT}^1_2$) asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we study the infinite pigeonhole principle from a…

We formalize various counting principles and compare their strengths over $V^{0}$. In particular, we conjecture the following mutual independence between: (1) a uniform version of modular counting principles and the pigeonhole principle for…

All rings are commutative, and all modules are unital. The purpose of this paper is to investigate the characterizations of weakly pseudo primary 2-absorbing sub-module in terms of some types of modules. We provide characterizations for the…

We implement a variant of the quantum pigeonhole paradox thought experiment to study whether classical counting principles survive in the quantum domain. We observe strong measurements significantly violate the pigeonhole principle (that…

We consider the Sherali-Adams (SA) refutation system together with the unusual binary encoding of certain combinatorial principles. For the unary encoding of the Pigeonhole Principle and the Least Number Principle, it is known that linear…

A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are…

We apply the pigeonhole principle to show that there must exist Boolean functions on 7 inputs with a multiplicative complexity of at least 7, i.e., that cannot be computed with only 6 multiplications in the Galois field with two elements.

We prove the consistency of the failure of the weak diamond $\Phi_\lambda$ at strongly inaccessible cardinals. On the other hand, we show that the very weak diamond $\Psi_\lambda$ is equivalent to the statement $2^{<\lambda}<2^\lambda$ and…

We consider the question of implementability of a social choice function in a classical setting where the preferences of finitely many selfish individuals with private information have to be aggregated towards a social choice. This is one…

We establish a course-of-values induction principle for K-finite sets in intuitionistic type theory. Using this principle, we prove a pigeonhole principle conjectured by Benabou and Loiseau. We also comment on some variants of this…

This paper provides an alternate characterization of type-two polynomial-time computability, with the goal of making second-order complexity theory more approachable. We rely on the usual oracle machines to model programs with subroutine…

The purpose of this paper is to prove a weak convergence result for empirical processes indexed in general classes of functions and with an underlying $\alpha$-mixing sequence of random variables. In particular the uniformly boundedness…

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

We study versions of the tree pigeonhole principle, $\mathsf{TT}^1$, in the context of Weihrauch-style computable analysis. The principle has previously been the subject of extensive research in reverse mathematics. Two outstanding…

In this study, all rings are commutative with non-zero identity and all modules are considered to be unital. Let $M$ be a left $R$-module. A proper submodule $N$ of $M$ is called an $S$-$weakly$ $prime$ submodule if $0_{M}\neq f(m)\in N$…

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…

The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…