相关论文: Hausdorff Reductions and the Exponential Hierarchi…

A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…

An automaton is partially ordered if the only cycles in its transition diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can be characterized by the Straubing-Th\'erien hierarchy. Level 3/2 is recognized by poNFAs,…

The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

Pudl\'ak [Pud17] lists several major conjectures from the field of proof complexity and asks for oracles that separate corresponding relativized conjectures. Among these conjectures are: - $\mathsf{DisjNP}$: The class of all disjoint…

We provide a categorical proof of convergence for martingales and backward martingales in mean, using enriched category theory. The enrichment we use is in topological spaces, with their canonical closed monoidal structure, which encodes a…

We show that Zilber's conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the first-order types in…

The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…

In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…

Many key invariants in the representation theory of classical groups (symmetric groups $S_n$, matrix groups $GL_n$, $O_n$, $Sp_{2n}$) are polynomials in $n$ (e.g., dimensions of irreducible representations). This allowed Deligne to extend…

There is a long tradition of categorifying combinatorial Hopf algebras by the modules of a tower of algebras (or even better via the representation theory of a tower of groups). From the point of view of combinatorics, such a…

Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is…

The arithmetical hierarchy (AH) is similar to the polynomial hierarchy (PH). Unlike the PH, the AH does not collapse relative to any oracle. A language in the (k + 1)-st level of the AH is computable enumerable (c.e.) relative to the kth…

We show that every finite-dimensional pointed Hopf algebra over a finite simple Chevalley group, different from $PSL_2(q)$ with q= 3 mod 4 (and from $PSL_3(2)\simeq PSL_2(7)$), is isomorphic to the corresponding group algebra. To do this,…

For separable $C^*$-algebras $A$ and $B$, we define a topology on the set $[[A, B]]$ consisting of homotopy classes of asymptotic morphisms from $A$ to $B$. This gives an enrichment of the Connes--Higson asymptotic category over topological…

We formalise, in Coq, the opening sections of Parity Complexes [Street1991] up to and including the all important excision of extremals algorithm. Parity complexes describe the essential combinatorial structure exhibited by simplexes, cubes…

Consider the problem of minimizing a polynomial $f$ over a compact semialgebraic set ${\mathbf{X} \subseteq \mathbb{R}^n}$. Lasserre introduces hierarchies of semidefinite programs to approximate this hard optimization problem, based on…

While numerous indices of inter-coder reliability exist, Krippendorff's {\alpha} and Cohen's \{kappa} have long dominated in communication studies and other fields, respectively. The near consensus, however, may be near the end. Recent…

Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…