相关论文: Boolean Term Orders and the Root System B_n

Second-order Boolean logic is a generalization of QBF, whose constant alternation fragments are known to be complete for the levels of the exponential time hierarchy. We consider two types of restriction of this logic: 1) restrictions to…

Rule set learning has long been studied and has recently been frequently revisited due to the need for interpretable models. Still, existing methods have several shortcomings: 1) most recent methods require a binary feature matrix as input,…

We combine the fixed-order evaluation of the $b\bar{b}$ sum rules with a non-relativistic effective-theory approach. The combined result for the $n$-th moment includes all terms suppressed with respect to the leading-order result by ${\cal…

The Boolean lattice $\mathcal{P}(n)$ consists of all subsets of $[n] = \{1,\dots, n\}$ partially ordered under the containment relation. Sperner's Theorem states that the largest antichain of the Boolean lattice is given by a middle layer:…

The dynamics of Boolean networks (BN) with quenched disorder and thermal noise is studied via the generating functional method. A general formulation, suitable for BN with any distribution of Boolean functions, is developed. It provides…

A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…

We propose a new class of mathematical structures called (m,n)-semirings} (which generalize the usual semirings), and describe their basic properties. We also define partial ordering, and generalize the concepts of congruence, homomorphism,…

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…

We introduce a universally applicable method, based on the bond-algebraic theory of dualities, to search for generalized order parameters in disparate systems including non-Landau systems with topological order. A key notion that we advance…

We investigate the randomized decision tree complexity of a specific class of read-once threshold functions. A read-once threshold formula can be defined by a rooted tree, every internal node of which is labeled by a threshold function…

In this study, we investigate the convergence rates for the homogenization of elliptic equations with lower-order terms under the spectral gap assumption, in both bounded domains and the entire space. Our analysis demonstrates that…

A slalom is a sequence of finite sets of length omega. Slaloms are ordered by coordinatewise inclusion with finitely many exceptions. Improving earlier results of Mildenberger, Shelah and Tsaban, we prove consistency results concerning…

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

In this paper we develop a notion of measure theory over boolean toposes which is analogous to noncommutative measure theory, i.e. to the theory of von Neumann algebras. This is part of a larger project to study relations between topos…

We solve the boson normal ordering problem for F[(a*)^r a^s], with r,s positive integers, where a* and a are boson creation and annihilation operators satisfying [a,a*]=1. That is, we provide exact and explicit expressions for the normal…

This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…

$\beta$-functions for abelian and non-abelian gauge theories are studied in the regime where the large $N$ flavor expansion is applicable. The first nontrivial order in the 1/$N$ expansion is known for any value of $N\alpha$, and there are…