Related papers: Hardness of monadic second-order formulae over suc…
Building upon previous works of Proudfoot and Ramos, and using the categorical framework of Sam and Snowden, we extend the weak categorical minor theorem from undirected graphs to quivers. As case of study, we investigate the consequences…
Several popular language models represent local contexts in an input text $x$ as bags of words. Such representations are naturally encoded by a sequence graph whose vertices are the distinct words occurring in $x$, with edges representing…
We find large N gauge theories containing a large number of operators within a band of low conformal dimensions. One of such examples is the four-dimensional N=1 supersymmetric SU(N) gauge theory with one adjoint and a pair of…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
Based on the Kazama-Suzuki type coset construction and its inverse coset between the subregular $\mathcal{W}$-algebras for $\mathfrak{sl}_n$ and the principal $\mathcal{W}$-superalgebras for $\mathfrak{sl}_{1|n}$, we prove weight-wise…
In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…
The unitary $N = 2$ superconformal minimal models have a long history in string theory and mathematical physics, while their non-unitary (and logarithmic) cousins have recently attracted interest from mathematicians. Here, we give an…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula phi(X,x) that is positive in X, it is decidable whether the…
Simplifying graphs is a very applicable problem in numerous domains, especially in computational geometry. Given a geometric graph and a threshold, the minimum-complexity graph simplification asks for computing an alternative graph of…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
We study soft SUSY breaking terms in heterotic M-theory. We show that both weakly and strongly coupled heterotic string models lead to the same relations of soft SUSY breaking terms, $A=-M$ and $m^2 = M^2/3$, up to $O((\alpha T/S)^2)$.
In this paper two related simplification problems for systems of linear inequalities describing precedence relation systems are considered. Given a precedence relation system, the first problem seeks a minimum subset of the precedence…
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…
Conformal symmetry underlies the mathematical description of various two-dimensional integrable models (e.g. for their Lax representation, Poisson algebra, zero curvature representation,...) or of conformal models (for the anomalous Ward…
Recently, developments in the understanding of low-energy N=1 supersymmetric gauge theory have revealed two important phenomena: the appearance of new four-dimensional superconformal field theories and a non-Abelian generalization of…
Triangulations and higher triangulations axiomatize the calculus of derived cokernels when applied to strings of composable morphisms. While there are no cubical versions of (higher) triangulations, in this paper we use coherent diagrams to…
We clarify some properties of projective superspace by using a manifestly superconformal notation. In particular, we analyze the N=2 scalar multiplet in detail, including its action, and the propagator and its super-Schwinger parameters.…
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…