Related papers: A Cloning Pushout Approach to Term-Graph Transform…
In this work we develop an integral representation for the partial $L$-function of a pair $\pi\times\tau$ of genuine irreducible cuspidal automorphic representations, $\pi$ of the $m$-fold covering of Matsumoto of the symplectic group…
In this paper, we begin the study of poles of partial L-functions L^S(sigma tensor tau,s), where sigma tensor tau is an irreducible, automorphic, cuspidal, generic (i.e. with nontrivial Whittaker coefficient) representation of G_A x…
We present a new supersymmetric index for three-dimensional ${\cal N}=2$ gauge theories defined on $\Sigma \times S^1$, where $\Sigma$ is a spindle, with twist or anti-twist for the $R$-symmetry background gauge field. We start examining…
We give a practical computer algebra implementation of the Covering Lemma for finite transformation semigroups. The lemma states that given a surjective relational morphism $(X,S)\twoheadrightarrow(Y,T)$, we can establish emulation by a…
Works on learning job title representation are mainly based on \textit{Job-Transition Graph}, built from the working history of talents. However, since these records are usually messy, this graph is very sparse, which affects the quality of…
Critical pair analysis provides a convenient and computable criterion of confluence, which is a fundamental property in rewriting theory, for a wide variety of rewriting systems. Bonchi et al. showed validity of critical pair analysis for…
Morphological analysis involves predicting the syntactic traits of a word (e.g. {POS: Noun, Case: Acc, Gender: Fem}). Previous work in morphological tagging improves performance for low-resource languages (LRLs) through cross-lingual…
Starting from the original Einstein action, sometimes called the Gamma squared action, we propose a new setup to formulate modified theories of gravity. This can yield a theory with second order field equations similar to those found in…
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…
A factor $u$ of a word $w$ is a cover of $w$ if every position in $w$ lies within some occurrence of $u$ in $w$. A word $w$ covered by $u$ thus generalizes the idea of a repetition, that is, a word composed of exact concatenations of $u$.…
Clustering is a commonplace problem in many areas of data science, with applications in biology and bioinformatics, understanding chemical structure, image segmentation, building recommender systems, and many more fields. While there are…
The convolution quadrature theory is a systematic approach to analyse the approximation of the Riemann-Liouville fractional operator $I^{\alpha}$ at node $x_{n}$. In this paper, we develop the shifted convolution quadrature ($SCQ$) theory…
We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics. For instance similarity between two papers can be based on common authors, where…
We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni's polygraphs, a kind of rewriting systems on algebraic circuits. We translate the considered TRS into a polygraph of…
Regluing is a topological operation that helps to construct topological models for rational functions on the boundaries of certain hyperbolic components. It also has a holomorphic interpretation, with the flavor of infinite dimensional…
In this paper, a new perspective is suggested for unsupervised Ontology Matching (OM) or Ontology Alignment (OA) by treating it as a translation task. Ontologies are represented as graphs, and the translation is performed from a node in the…
The lack of convergence of the convolution integrals appearing in next-to-leading-power (NLP) factorization theorems prevents the applications of existing methods to resum power-suppressed large logarithmic corrections in collider physics.…
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in…
Graph generation is a fundamental task with broad applications, such as drug discovery. Recently, discrete flow matching-based graph generation, \aka, graph flow model (GFM), has emerged due to its superior performance and flexible…
Text Simplification improves the readability of sentences through several rewriting transformations, such as lexical paraphrasing, deletion, and splitting. Current simplification systems are predominantly sequence-to-sequence models that…