Related papers: Immunity and Simplicity for Exact Counting and Oth…

Let $\mathbf{M}$ be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, $\Delta_0$-separation and set foundation. This paper studies the relative strength of…

In Heintz-Schnorr (1982), the authors introduced the notion of correct test sequence and since then it has been widely used to design probabilistic algorithms for Polynomial Equality Test. The aim of this manuscript is to study the…

This thesis investigates the extent to which the optimal value of a constraint satisfaction problem (CSP) can be approximated by some sentence of fixed point logic with counting (FPC). It is known that, assuming $\mathsf{P} \neq…

The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…

Let $p$ be a prime. In 2017, Kemarsky, Paulin, and Shapira (KPS) conjectured that any Laurent series over $\mathbb{F}_p$ exhibits full escape of mass with respect to any irreducible polynomial $P(t)\in\mathbb{F}_p[t]$. In 2025, this was…

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],…

The Ideal Proof System (IPS) of Grochow & Pitassi (FOCS 2014, J. ACM, 2018) is an algebraic proof system that uses algebraic circuits to refute the solvability of unsatisfiable systems of polynomial equations. One potential drawback of IPS…

The celebrated result of Kabanets and Impagliazzo (Computational Complexity, 2004) showed that PIT algorithms imply circuit lower bounds, and vice versa. Since then it has been a major challenge to understand the precise connections between…

We study the relation between primariness of Banach spaces and the stronger operator-theoretic notions of the primary factorisation property (PFP) and the uniform primary factorisation property (UPFP). We revisit several classical…

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

Let $P$ be a $k$-ary predicate over a finite alphabet. Consider a random CSP$(P)$ instance $I$ over $n$ variables with $m$ constraints. When $m \gg n$ the instance $I$ will be unsatisfiable with high probability, and we want to find a…

Conformal Prediction (CP) is a popular method for uncertainty quantification with machine learning models. While conformal prediction provides probabilistic guarantees regarding the coverage of the true label, these guarantees are agnostic…

Answering a question of Sakai, we show that the minimal cardinality of a set of reals X such that C_p(X) does not have the Pytkeev property is equal to the pseudo-intersection number p. Our approach leads to a natural characterization of…

We show that, consistently, there exists a Borel set B subset Cantor admitting a sequence (eta_alpha:alpha<lambda) of distinct elements of Cantor such that (eta_alpha+B) cap (eta_beta+B) is uncountable for all alpha,beta<lambda but with no…

It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…

While counterfactual fairness of point predictors is well studied, its extension to prediction sets--central to fair decision-making under uncertainty--remains underexplored. On the other hand, conformal prediction (CP) provides efficient,…

For a $k$-ary predicate $P$, a random instance of CSP$(P)$ with $n$ variables and $m$ constraints is unsatisfiable with high probability when $m \gg n$. The natural algorithmic task in this regime is \emph{refutation}: finding a proof that…

We prove that for any positive integers $n$ and $d$ there exists a collection consisting of $f=d\log n+O(1)$ subsets $A_1, A_2, \ldots, A_f$ of $[n]$ such that for any two distinct subsets $X$ and $Y$ of $[n]$ whose size is at most $d$…

We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…