Related papers: The Classes PPA-$k$: Existence from Arguments Modu…

In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…

Let $a_k(n)$ denote the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may be ``colored" with one of $k$ colors, for fixed $k$. In this note, we find some congruences for $a_k(n)$ in the spirit of…

We show that if $A$ is a subset of a group of prime order $p$ such that $|2A|<2.7652|A|$ and $|A|<1.25\cdot10^{-6}p$, then $A$ is contained in an arithmetic progression with at most $|2A|-|A|+1$ terms, and $2A$ contains an arithmetic…

Recently, Pasarkar, Papadimitriou, and Yannakakis (ITCS 2023) have introduced the new TFNP subclass called PLC that contains the class PPP; they also have proven that several search problems related to extremal combinatorial principles…

Given a division ring K containing the field k in its center and A,B two finite subsets of K\{0}, we give some analogues of Pl\"unnecke and Kneser theorems for the dimension of the k-linear span of the Minkowski product AB in terms of the…

We introduce a higher-arity stability notion defined in terms of $k$-splitting, a higher-arity generalization of splitting. We show that theories with bounded $k$-splitting have improved indiscernible extraction at $k$-ineffable cardinals,…

Let $R$ be a strong $n$-coherent ring such that each finitely $n$-presented $R$-module has finite projective dimension. We consider $\mathcal{FP}_{n}(R)$ the full subcategory of $R$-Mod of finitely $n$-presented modules. We prove that…

The 2-color partitions may be considered as an extension of regular partitions of a natural number $n$, with $p_{k}(n)$ defined as the number of 2-colored partitions of $n$ where one of the 2 colors appears only in parts that are multiples…

Assume that $p>2$, and let $\mathscr{O}_K$ be a $p$-adic discrete valuation ring with residue field admitting a finite $p$-basis, and let $R$ be a formally smooth formally finite-type $\mathscr{O}_K$-algebra. (Indeed, we allow slightly more…

The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…

We survey the complexity class $\exists \mathbb{R}$, which captures the complexity of deciding the existential theory of the reals. The class $\exists \mathbb{R}$ has roots in two different traditions, one based on the Blum-Shub-Smale model…

Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…

Constraint satisfaction problems have been studied in numerous fields with practical and theoretical interests. In recent years, major breakthroughs have been made in a study of counting constraint satisfaction problems (or #CSPs). In…

A classical problem in analytic number theory is to study the distribution of fractional part $\alpha p^k+\beta,\,k\ge 1$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. For $k=2$ we consider the subsequence…

Clustering is a fundamental tool in data mining. It partitions points into groups (clusters) and may be used to make decisions for each point based on its group. However, this process may harm protected (minority) classes if the clustering…

In this paper we study the fine-grained complexity of finding exact and approximate solutions to problems in P. Our main contribution is showing reductions from exact to approximate solution for a host of such problems. As one (notable)…

In connection with machine arithmetic, we are interested in systems of constraints of the form x + k \leq y + k'. Over integers, the satisfiability problem for such systems is polynomial time. The problem becomes NP complete if we restrict…

In this paper, we use our previous study of the higher order Bernoulli numbers $B_n^{(l)}$ to investigate the $p$-adic properties of the Stirling numbers of the second kind $S(n,k)$. For example, we give a new, greatly simplified proof of…

We consider the classic Facility Location, $k$-Median, and $k$-Means problems in metric spaces of doubling dimension $d$. We give nearly linear-time approximation schemes for each problem. The complexity of our algorithms is…

For a finite group scheme G over an algebraically closed field k of characteristic p>0 we study G-modules M, which are defined in terms of properties of their pull-backs along p-points of G. We show that the corresponding subcategories…