Related papers: The Conjugacy Relation on One-sided Subshifts is N…
The joint entity and relation extraction task aims to extract all relational triples from a sentence. In essence, the relational triples contained in a sentence are unordered. However, previous seq2seq based models require to convert the…
Inspired by the classic problem of Boolean function monotonicity testing, we investigate the testability of other well-studied properties of combinatorial finite set systems, specifically \emph{intersecting} families and \emph{union-closed}…
We construct a supersymmetric version of the ``critical'' non-relativistic bosonic string theory\cite{Kim:2007hb} with its manifest global symmetry. We introduce the anticommuting $bc$ CFT which is the super partner of the $\beta\gamma$…
We investigate the most general non(anti)commutative geometry in N=1 four-dimensional superspace, invariant under the classical (i.e., undeformed) supertranslation group. We find that a nontrivial non(anti)commutative superspace geometry…
We establish a combinatorial connection between the sequence $(i_{n,k})$ counting the involutions on $n$ letters with $k$ descents and the sequence $(a_{n,k})$ enumerating the semistandard Young tableaux on $n$ cells with $k$ symbols. This…
The non-associativity of translations in a quantum system with magnetic field background has received renewed interest in association with topologically trivial gerbes over $\mathbb{R}^n.$ The non-associativity is described by a 3-cocycle…
Let A be an idempotent algebra on a 3-element domain D that omits a G-set for a factor. Suppose A is not \alpha\beta-projective (for some alpha, beta subsets of D) and is not collapsible. It follows that A is switchable. We prove that, for…
We characterize disjoint and simultaneously hypercyclic tuples of unilateral pseudo-shift operators on $\ell^p(\mathbb{N})$. As a consequence, complementing the results of Bernal and Jung, we give a characterization for simultaneously…
We study the topological entropy of hom tree-shifts and show that, although the topological entropy is not a conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In…
Motivated by the continuing interest in the tree data model, we study the expressive power of downward navigational query languages on trees and chains. Basic navigational queries are built from the identity relation and edge relations…
Various structural properties are developed for non-orientable surfaces in link spaces. The M\"obius band tree is described to represent genus growth of one-sided surfaces in solid tori. The structure of the Tree allows various insights…
Let X be a smooth algebraic variety over a field of characteristic 0. We introduce the notion of twisted associative (resp. Poisson) deformation of the structure sheaf O_X. These are stack-like versions of usual deformations. We prove that…
We study a class of signomials whose positive support is the set of vertices of a simplex and which may have several negative support points in the simplex. Various groups of authors have provided an exact characterization for the global…
Any binary string can be associated with a unary predicate $P$ on $\mathbb{N}$. In this paper we investigate subsets named by a predicate $P$ such that the relation $P(x+y)$ has finite VC dimension. This provides a measure of complexity for…
Let G' be a connected reductive group over the complex numbers. We show that the set of conjugacy classes of G' is in natural bijection with the set of two-sided cells associated to a certain algebra.
Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form ... A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and…
We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…
We deform the standard four dimensional $\N=1$ superspace by making the odd coordinates $\theta$ not anticommuting, but satisfying a Clifford algebra. Consistency determines the other commutation relations of the coordinates. In particular,…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…