English
Related papers

Related papers: Enumeration of Rota-Baxter Words

200 papers

We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset…

Dynamical Systems · Mathematics 2024-04-08 Godofredo Iommi , Mario Ponce

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…

Discrete Mathematics · Computer Science 2008-09-16 Emilie Charlier , Michel Rigo , Wolfgang Steiner

In this paper we study $k$-order homogeneous Rota-Baxter operators with weight $1$ on the simple $3$-Lie algebra $A_{\omega}$ (over a field of characteristic zero), which is realized by an associative commutative algebra $A$ and a…

Mathematical Physics · Physics 2016-09-28 Ruipu Bai , Yinghua Zhang

All Rota-Baxter operators of weight zero on split octonion algebra over a~field of characteristic not 2 are classified up to conjugation by automorphisms and antiautomorphisms. Thus, the classification of Rota-Baxter operators on…

Rings and Algebras · Mathematics 2024-06-25 A. S. Panasenko

The intensive study of Rota-Baxter operators on the polynomial algebra $F[x]$ has been started with the work of S.H. Zheng, L. Guo, and M. Rosenkranz (2015). We deal with the case of two variables and monomial Rota-Baxter operators of…

Rings and Algebras · Mathematics 2022-10-31 Artem Khodzitskii

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2010-10-01 Alwen Tiu , Alberto Momigliano

Recently, there has been a lot of effort to represent words in continuous vector spaces. Those representations have been shown to capture both semantic and syntactic information about words. However, distributed representations of phrases…

Computation and Language · Computer Science 2015-06-19 Rémi Lebret , Ronan Collobert

We introduce the notion of multi-patterns, a combinatorial abstraction of polyphonic musical phrases. The interest of this approach in encoding musical phrases lies in the fact that it becomes possible to compose multi-patterns in order to…

Sound · Computer Science 2024-04-30 Samuele Giraudo

Quantum contextuality turns out to be a necessary resource for universal quantum computation and also has applications in quantum communication. Thus it becomes important to generate contextual sets of arbitrary structure and complexity to…

Quantum Physics · Physics 2019-05-07 Mladen Pavicic , Mordecai Waegell , Norman D. Megill , P. K. Aravind

We present an example of a quadratic algebra given by three generators and three relations, which is automaton (the set of normal words forms a regular language) and such that its ideal of relations does not possess a finite Gr\"obner basis…

Rings and Algebras · Mathematics 2020-08-04 Natalia Iyudu , Stanislav Shkarin

Aggregates are among the most frequently used linguistic extensions of answer set programming. The result of an aggregation may introduce new constants during the instantiation of the input program, a feature known as value invention. When…

Logic in Computer Science · Computer Science 2018-04-24 Mario Alviano , Carmine Dodaro , Marco Maratea

In the paper, we introduce the notion of a Rota-Baxter operator of a non-scalar weight. As a motivation, we show that there is a natural connection between Rota-Baxter operators of this type and structures of quasitriangular Lie bialgebras…

Rings and Algebras · Mathematics 2024-04-10 Maxim Goncharov

Word embedding is a powerful tool in natural language processing. In this paper we consider the problem of word embedding composition \--- given vector representations of two words, compute a vector for the entire phrase. We give a…

Machine Learning · Computer Science 2019-02-05 Abraham Frandsen , Rong Ge

Rota's basis conjecture states that in any square array of vectors whose rows are bases of a fixed vector space the vectors can be rearranged within their rows in such a way that afterwards not only the rows are bases, but also the columns.…

Combinatorics · Mathematics 2017-10-10 Guus P. Bollen , Jan Draisma

We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…

Discrete Mathematics · Computer Science 2015-03-18 Jean-Marc Fédou , Gabriele Fici

Randomized controlled trials (RCTs) represent the paramount evidence of clinical medicine. Using machines to interpret the massive amount of RCTs has the potential of aiding clinical decision-making. We propose a RCT conclusion generation…

Computation and Language · Computer Science 2019-10-04 Alexander Te-Wei Shieh , Yung-Sung Chuang , Shang-Yu Su , Yun-Nung Chen

A parallel method for computing Boolean expressions based on the properties of finite free Boolean algebras is presented. We also show how various finite combinatorial objects can be codded in the formalism of Boolean algebras and counted…

Logic in Computer Science · Computer Science 2013-10-28 Zarko Mijajlovic , Aleksandar Pejovic

Rota-Baxter operators on algebras, which appeared in 1960, have connections with different versions of the Yang-Baxter equation, pre- and postalgebras, double Poisson algebras, etc. In 2020, the notion of Rota-Baxter operator on a group was…

Group Theory · Mathematics 2024-04-23 Alexey Galt , Vsevolod Gubarev

A systematic study of holomorphic gauge invariant operators in general $\mathcal{N}=1$ quiver gauge theories, with unitary gauge groups and bifundamental matter fields, was recently presented in [1]. For large ranks a simple counting…

High Energy Physics - Theory · Physics 2014-12-19 Paolo Mattioli , Sanjaye Ramgoolam

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

Logic in Computer Science · Computer Science 2023-02-10 Martin Svatoš , Peter Jung , Jan Tóth , Yuyi Wang , Ondřej Kuželka
‹ Prev 1 4 5 6 7 8 10 Next ›