Related papers: Implementing Anti-Unification Modulo Equational Th…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
As machine learning applications grow increasingly ubiquitous and complex, they face an increasing set of requirements beyond accuracy. The prevalent approach to handle this challenge is to aggregate a weighted combination of requirement…
We prove a matrix inequality for matrix monotone functions, and apply it to prove a singular value inequality for Heinz means recently conjectured by X. Zhan.
Word representations induced from models with discrete latent variables (e.g.\ HMMs) have been shown to be beneficial in many NLP applications. In this work, we exploit labeled syntactic dependency trees and formalize the induction problem…
Error: Peer-review process exposed an error in Theorem 1 that, unfourtunately, is not repairable. Idempotent semigroups are always finite. See Green and Rees [1952], Siekmann and Szab\'o [1981] for details Anti-unification is a fundamental…
We study the unitarizability of premodular categories constructed from representations of quantum group at roots of unity. We introduce \emph{Grothendieck unitarizability} as a natural generalization of unitarizability to any class of…
A practical automatic textual math word problems (MWPs) solver should be able to solve various textual MWPs while most existing works only focused on one-unknown linear MWPs. Herein, we propose a simple but efficient method called Universal…
We construct the Generalized Monodromy matrix $\mathcal{\hat{M}}(\omega)$ of two dimensional string effective action by introducing the T-duality group properties.The integrability conditions with general solutions depending on spectral…
Manna and Waldinger's theory of substitutions and unification has been verified using the Cambridge LCF theorem prover. A proof of the monotonicity of substitution is presented in detail, as an example of interaction with LCF. Translating…
A highly anticipated use of quantum computers is the simulation of complex quantum systems including molecules and other many-body systems. One promising method involves directly applying a linear combination of unitaries (LCU) to…
We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…
For a split reductive algebraic group, this paper observes a homological interpretation for Weyl module multiplicities in Jantzen's sum formula. This interpretation involves an Euler characteristic built from Ext groups between integral…
We provide a novel mathematical implementation of tree-adjoining grammars using two combinatorial definitions of graphs. With this lens, we demonstrate that the adjoining operation defines a pre-Lie operation and subsequently forms a Lie…
Following Mitchell's philosophy, in this paper we define the analogous of the triangular matrix algebra to the context of rings with several objects. Given two additive categories $\mathcal{U}$ and $\mathcal{T}$ and $M\in…
We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch…
We formalize the Gauss-Landau theorem, providing a unified prime factorization approach to computing the GCD and LCM of finite nonzero integer sets. Although commonly used as a heuristic or technique in elementary number theory education,…
We show how to use Jantzen's sum formula for Weyl modules to prove semisimplicity criteria for endomorphism algebras of $\textbf{U}_q$-tilting modules (for any field $\mathbb{K}$ and any parameter $q\in\mathbb{K}-\{0,-1\}$). As an…
The recent tremendous success of unsupervised word embeddings in a multitude of applications raises the obvious question if similar methods could be derived to improve embeddings (i.e. semantic representations) of word sequences as well. We…