Related papers: $q$-Derivative Grammar
Morphological segmentation has traditionally been modeled with non-hierarchical models, which yield flat segmentations as output. In many cases, however, proper morphological analysis requires hierarchical structure -- especially in the…
The notion of relative derived category with respect to a subcategory is introduced. A triangle-equivalence, which extends a theorem of Gao and Zhang [Gorenstein derived categories, \emph{J. Algebra} \textbf{323} (2010) 2041-2057] to the…
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of a rejection-based approach, whose time complexity is shown…
Fractional calculus and q-deformed Lie algebras are closely related. Both concepts expand the scope of standard Lie algebras to describe generalized symmetries. A new class of fractional q-deformed Lie algebras is proposed, which for the…
I continue the investigation of a q-analogue of the convolution on the line started in a joint work with Koornwinder and based on a formal definition due to Kempf and Majid. Two different ways of approximating functions by means of the…
The $q$-calculus is reformulated in terms of the umbral calculus and of the associated operational formalism. We show that new and interesting elements emerge from such a restyling. The proposed technique is applied to a different…
The $q$-commutation relations, formulated in the setting of the $q$-Fock space of Bo\.zjeko and Speicher, interpolate between the classical commutation relations (CCR) and the classical anti-commutation relations (CAR) defined on the…
In this paper, we present a gradient-free approach for training multi-layered neural networks based upon quantum perceptrons. Here, we depart from the classical perceptron and the elemental operations on quantum bits, i.e. qubits, so as to…
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as…
The interest in $q$-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and…
Generative commonsense reasoning refers to the task of generating acceptable and logical assumptions about everyday situations based on commonsense understanding. By utilizing an existing dataset such as Korean CommonGen, language…
We formulate and discuss two conjectures concerning recursive formulae for Branson's $Q$-curvatures. The proposed formulae describe all $Q$-curvatures on manifolds of all even dimensions in terms of respective lower order $Q$-curvatures and…
In this paper, we propose a new concept of derivative with respect to an arbitrary kernel-function. Several properties related to this new operator, like inversion rules, integration by parts, etc. are studied. In particular, we introduce…
In this paper, we get the generating functions of q-Chebyshev polynomials using operator. Also considering explicit formulas of q-Chebyshev polynomials, we give new generalizations of q-Chebyshev polynomials called incomplete q-Chebyshev…
In this paper we present several natural $q$-analogues of the poly-Bernoulli numbers arising in combinatorial contexts. We also recall some relating analytical results and ask for combinatorial interpretations.
With one exception, our previous work on recurrence extraction and denotational semantics has focused on a source language that supports inductive types and structural recursion. The exception handles general recursion via an initial…
We propose a new type of representation learning method that models words, phrases and sentences seamlessly. Our method does not depend on word segmentation and any human-annotated resources (e.g., word dictionaries), yet it is very…
Neural QCFG is a grammar-based sequence-tosequence (seq2seq) model with strong inductive biases on hierarchical structures. It excels in interpretability and generalization but suffers from expensive inference. In this paper, we study two…
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…
Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two…