English
Related papers

Related papers: Using the No-Search Easy-Hard Technique for Downwa…

200 papers

In the paper "Uniformity of Mordell-Lang" by Vesselin Dimitrov, Philipp Habegger and Ziyang Gao (arXiv:2001.10276), they use Silverman-Tate's Height Inequality and they give a proof of the same which makes use of Cartier divisors and hence…

Number Theory · Mathematics 2024-04-04 Debam Biswas , Zhelun Chen

The Constant Degree Hypothesis was introduced by Barrington et. al. (1990) to study some extensions of $q$-groups by nilpotent groups and the power of these groups in a certain computational model. In its simplest formulation, it…

Computational Complexity · Computer Science 2023-11-30 Piotr Kawałek , Armin Weiß

We prove lifting theorems for complex representations $V$ of finite groups $G$. Let $\sigma=(\sigma_1,\dots,\sigma_n)$ be a minimal system of homogeneous basic invariants and let $d$ be their maximal degree. We prove that any continuous map…

Classical Analysis and ODEs · Mathematics 2021-04-13 Adam Parusiński , Armin Rainer

We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the…

Computational Complexity · Computer Science 2026-03-24 M. Alasli

Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…

Logic in Computer Science · Computer Science 2023-02-15 Nicolai Kraus , Jakob von Raumer

For positive integers $d<k$ and $n$ divisible by $k$, let $m_{d}(k,n)$ be the minimum $d$-degree ensuring the existence of a perfect matching in a $k$-uniform hypergraph. In the graph case (where $k=2$), a classical theorem of Dirac says…

Combinatorics · Mathematics 2022-08-05 Asaf Ferber , Matthew Kwan

We obtain new invariants of topological link concordance and homology cobordism of 3-manifolds from Hirzebruch-type intersection form defects of towers of iterated p-covers. Our invariants can extract geometric information from an arbitrary…

Geometric Topology · Mathematics 2008-06-16 Jae Choon Cha

Suppose $X$ is a uniformly distributed $n$-dimensional binary vector and $Y$ is obtained by passing $X$ through a binary symmetric channel with crossover probability $\alpha$. A recent conjecture by Courtade and Kumar postulates that…

Information Theory · Computer Science 2015-06-02 Or Ordentlich , Ofer Shayevitz , Omri Weinstein

We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph…

Combinatorics · Mathematics 2017-07-07 Reinhard Diestel , Philipp Eberenz , Joshua Erde

We use sup-convolution to find upper approximations of a bounded $m$-subharmonic function on a compact K\"ahler manifold with nonnegative holomorphic bisectional curvature. As an application, we show the H\"older continuity of solutions to…

Analysis of PDEs · Mathematics 2022-09-01 Jingrui Cheng , Yulun Xu

The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient space obtained by collapsing each equivalence class to a point is a metric space with appealing analytic properties. We show that the…

Probability · Mathematics 2013-12-31 Peter Orbanz , Balazs Szegedy

Let $\Lambda$ be the limit set of an infinite conformal iterated function system and let $F$ denote the set of fixed points of the maps. We prove that the box dimension of $\Lambda$ exists if and only if \[ \overline{\dim}_{\mathrm B} F\leq…

Dynamical Systems · Mathematics 2024-08-13 Amlan Banaji , Alex Rutar

We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions F on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric…

Computational Complexity · Computer Science 2018-01-11 Jin-Yi Cai , Heng Guo , Tyson Williams

We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Logic in Computer Science · Computer Science 2017-07-19 Thomas Place , Marc Zeitoun

Usually one compares the accuracy of two competing classifiers via null hypothesis significance tests (nhst). Yet the nhst tests suffer from important shortcomings, which can be overcome by switching to Bayesian hypothesis testing. We…

Machine Learning · Computer Science 2016-11-23 Giorgio Corani , Alessio Benavoli , Janez Demšar , Francesca Mangili , Marco Zaffalon

Following Beck's work on toral translations relative to straight boxes in $\mathbb{T}^n$, we prove a weaker upper bound and the same lower bound for ergodic discrepancies of toral translations relative to a triangle in $\mathbb{T}^2$.…

Number Theory · Mathematics 2021-12-21 Hao Wu

For any $n > 0$ and $0 \leq m < n$, let $P_{n,m}$ be the poset of projective equivalence classes of $\{-,0,+\}$-vectors of length $n$ with sign variation bounded by $m$, ordered by reverse inclusion of the positions of zeros. Let…

Combinatorics · Mathematics 2020-12-29 Nantel Bergeron , Aram Dermenjian , John Machacek

In the absence of governing equations, dimensional analysis is a robust technique for extracting insights and finding symmetries in physical systems. Given measurement variables and parameters, the Buckingham Pi theorem provides a procedure…

Machine Learning · Computer Science 2022-02-11 Joseph Bakarji , Jared Callaham , Steven L. Brunton , J. Nathan Kutz

The Penrose triangle, staircase, and related ``impossible objects'' have long been understood as related to first cohomology $H^1$: the obstruction to extending locally consistent interpretations around a loop. This paper develops a…

Algebraic Topology · Mathematics 2026-02-11 Lewis Ghrist , Robert Ghrist

Recently, data abstraction has been studied in the context of separation logic, with noticeable practical successes: the developed logics have enabled clean proofs of tricky challenging programs, such as subject-observer patterns, and they…

Programming Languages · Computer Science 2015-07-01 Jacob Thamsborg , Lars Birkedal , Hongseok Yang