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

We consider the problem of jointly minimizing forms of two Boolean functions $f, g \colon \{0,1\}^J \to \{0,1\}$ such that $f + g \leq 1$ and so as to separate disjoint sets $A \cup B \subseteq \{0,1\}^J$ such that $f(A) = \{1\}$ and $g(B)…

For every integer $d\ge 1$, there is a unital closed subalgebra $A_d\subset B(H)$ with similarity degree equal precisely to $d$, in the sense of our previous paper. This means that for any unital homomorphism $u\colon A_d\to B(H)$ we have…

It is well-known that every first-order property on words is expressible using at most three variables. The subclass of properties expressible with only two variables is also quite interesting and well-studied. We prove precise structure…

Query equivalence is investigated for disjunctive aggregate queries with negated subgoals, constants and comparisons. A full characterization of equivalence is given for the aggregation functions count, max, sum, prod, toptwo and parity. A…

We construct an integrable hierarchy in terms of vertex operators and Hirota Quadratic Equations (HQE shortly) and we show that the equivariant total descendant potential of $\C P^1$ satisfies the HQE. Our prove is based on the quantization…

We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and transfinite-order arithmetic, extending the…

We consider the evaluation of first-order queries over classes of databases that have bounded degree and low degree. More precisely, given a query and a database, we want to efficiently test whether there is a solution, count how many…

The statement of Lemma 3.1 in the published paper is not correct. Lemma 3.1 is needed for the proof of Theorem 3.2. Theorem 3.2 as originally stated is true but its "proof" is not correct. Here we change the statements and proofs of Lemma…

Learning generalizable self-supervised graph representations for downstream tasks is challenging. To this end, Contrastive Learning (CL) has emerged as a leading approach. The embeddings of CL are arranged on a hypersphere where similarity…

B\'ar\'any's "topological Tverberg conjecture" from 1976 states that any continuous map of an $N$-simplex $\Delta_N$ to $\mathbb{R}^d$, for $N\ge(d+1)(r-1)$, maps points from $r$ disjoint faces in $\Delta_N$ to the same point in…

Let $-\im\Lie_\T$ (essentially Lie derivative with respect to $\T$, a smooth nowhere zero real vector field) and $P$ be commuting differential operators, respectively of orders 1 and $m\geq 1$, the latter formally normal, both acting on…

The class of $(d-1)$-dimensional Buchsbaum* simplicial complexes is studied. It is shown that the rank-selected subcomplexes of a (completely) balanced Buchsbaum* simplicial complex are also Buchsbaum*. Using this result, lower bounds on…

We study the Lane-Emden conjecture, which asserts the non-existence of non-trivial, non-negative solutions to the Lane-Emden system \[ -\Delta u = v^p, \quad -\Delta v = u^q, \quad x \in \mathbb{R}^n\] in the subcritical regime. By…

In this paper we are shown the following facts: The probability of increased $ A_{k}=P(T^{k} (x_{0})>T^{k-1} (x_{0})) $, and the probability of decrease $B_{k}=P(T^{k} (x_{0})<T^{k-1} (x_{0}))$ in step $ k $ of a Collataz procedure…

The purpose of this paper is to complete the proof of the following result. Let $0 < \beta \leq \alpha < 1$ and $\kappa > 0$. Then, there exists $\eta > 0$ such that whenever $A,B \subset \mathbb{R}$ are Borel sets with $\dim_{\mathrm{H}} A…

There is a recently discovered and intriguing phenomenon called Neural Collapse: at the terminal phase of training a deep neural network for classification, the within-class penultimate feature means and the associated classifier vectors of…

In multiple-choice data structures each element $x$ in a set $S$ of $m$ keys is associated with a random set $e(x) \subseteq [n]$ of buckets with capacity $\ell \geq 1$ by hash functions. This setting is captured by the hypergraph $H =…

The h-cobordism theorem is a noted theorem in differential and PL topology. A generalization of the h-cobordism theorem for possibly non simply connected manifolds is the so called s-cobordism theorem. In this paper, we prove semialgebraic…

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

Working with the simple types over a base type of natural numbers (including product types), we consider the question of when a type $\sigma$ is encodable as a definable retract of $\tau$: that is, when there are $\lambda$-terms…