Related papers: Low Sets and Closure Properties of Counting Functi…

We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…

The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to the number partition problem with number range restricted.…

We prove a contraction property of Fock type spaces $\mathcal{L}_{\alpha}^p$ of log-subharmonic functions in $\mathbb{R}^n$. To prove the result, we demonstrate a certain monotonic property of measures of the superlevel set of the function…

In this paper we study the complexity of the problems: given a loop, described by linear constraints over a finite set of variables, is there a linear or lexicographical-linear ranking function for this loop? While existence of such…

These notes are defining the notion of centric linking system for a locally finite group If a locally finite group $G$ has countable Sylow $p$-subgroups, we prove that, with a countable condition on the set of intersections, the…

We prove that many of the results of the LMMP hold for $3$-folds over fields of characteristic $p>5$ which are not necessarily perfect. In particular, the existence of flips, the cone theorem, the contraction theorem for birational extremal…

Denote by $\mathbf C_p[\mathfrak M_0]$ the $C_p$-stable closure of the class $\mathfrak M_0$ of all separable metrizable spaces, i.e., $\mathbf C_p[\mathfrak M_0]$ is the smallest class of topological spaces that contains $\mathfrak M_0$…

We study the existence of optimal and p-optimal proof systems for classes in the Boolean hierarchy over $\mathrm{NP}$. Our main results concern $\mathrm{DP}$, i.e., the second level of this hierarchy: If all sets in $\mathrm{DP}$ have…

In all well-studied $\mathsf{TFNP}$ subclasses (e.g. $\mathsf{PPA}, \mathsf{PPP}$ etc.), the canonical complete problem takes as input a polynomial-size circuit $C: \{ 0, 1\}^n \rightarrow \{ 0, 1\}^m$ whose input-output behavior implicitly…

Large language models (LLMs) such as T0, FLAN, and OPT-IML, excel in multi-tasking under a unified instruction-following paradigm, where they also exhibit remarkable generalization abilities to unseen tasks. Despite their impressive…

Though discourse parsing can help multiple NLP fields, there has been no wide language model search done on implicit discourse relation classification. This hinders researchers from fully utilizing public-available models in discourse…

A language is said to be in catalytic logspace if we can test membership using a deterministic logspace machine that has an additional read/write tape filled with arbitrary data whose contents have to be restored to their original value at…

Retrained large language models (LLMs) have become extensively used across various sub-disciplines of natural language processing (NLP). In NLP, text classification problems have garnered considerable focus, but still faced with some…

A topological space $Y$ has the property (B) of Banakh if there is a countable family $\{A_n:n\in \mathbb{N}\}$ of closed nowhere dense subsets of $Y$ absorbing all compact subsets of $Y$. In this note we show that the space $C_p(X)$ of…

If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…

We present a systematic empirical study of small language models under strict compute constraints, analyzing how architectural choices and training budget interact to determine performance. Starting from a linear next-token predictor, we…

According to Lazard, every p-adic Lie group contains an open pro-p subgroup which is saturable. This can be regarded as the starting point of p-adic Lie theory, as one can naturally associate to every saturable pro-p group G a Lie lattice…

The disparity in language resources poses a challenge in multilingual NLP, with high-resource languages benefiting from extensive data, while low-resource languages lack sufficient data for effective training. Our Contrastive Language…

Let $\mathcal{F} $ be a pointwise almost periodic decomposition of a compact metrizable space $X$. Then $\mathcal{F} $ is $R$-closed if and only if $\hat{\mathcal{F}} $ is usc. Moreover, if there is a finite index normal subgroup $H$ of an…

In the last years renewed investigation of operator precedence languages (OPL) led to discover important properties thereof: OPL are closed with respect to all major operations, are characterized, besides the original grammar family, in…