Related papers: Free augmented LD-systems
Enabling a high-degree-of-freedom robot to learn specific skills is a challenging task due to the complexity of robotic dynamics. Reinforcement learning (RL) has emerged as a promising solution; however, addressing such problems requires…
We give a new proof of a result from well quasi-order theory on the computability of bases for upwards-closed sets of words. This new proof is based on Angluin's L* algorithm, that learns an automaton from a minimally adequate teacher. This…
Large Language Models (LLMs) exhibit nonlinear relationships between performance, cost, and token usage. This paper presents a quantitative study on structured prompting using BRAID (Bounded Reasoning for Au tonomous Inference and…
(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…
Deploying guardrails for custom policies remains challenging, as generic safety models fail to capture task-specific requirements, while prompting LLMs suffers from inconsistent boundary-case performance and high inference costs. Training…
Large language models (LLMs) are achieving significant progress almost every moment now. Many advanced techniques have been introduced and widely accepted, like retrieval-augmentation generation (RAG), agents, and tools. Tools can query the…
A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is…
While extensive research has explored the use of large language models (LLMs) for table-based reasoning, most approaches struggle with scalability when applied to large tables. To maintain the superior comprehension abilities of LLMs in…
Palindromes are those reduced words of free products of groups that coincide with their reverse words. We prove that a free product of groups $G$ has infinite palindromic width, provided that $G$ is not the free product of two cyclic groups…
We construct a basis for free Lie algebras via a ``left-greedy'' bracketing algorithm on Lyndon-Shirshov words. We use a new tool -- the configuration pairing between Lie brackets and graphs of Sinha-Walter -- to show that the left-greedy…
This paper addresses problems of second-order cone programming important in optimization theory and applications. The main attention is paid to the augmented Lagrangian method (ALM) for such problems considered in both exact and inexact…
We introduce a notion of "freely braided element" for simply laced Coxeter groups. We show that an arbitrary group element $w$ has at most $2^{N(w)}$ commutation classes of reduced expressions, where $N(w)$ is a certain statistic defined in…
A free multiarrangement of rank $k$ is defined to be extendable if it is obtained from a simple rank $(k+1)$ free arrangement by the natural restriction to a hyperplane (in the sense of Ziegler). Not all free multiarrangements are…
The duality principle for Gabor frames states that a Gabor sequence obtained by a time-frequency lattice is a frame for $L^{2}(\R^{d})$ if and only if the associated adjoint Gabor sequence is a Riesz sequence. We prove that this duality…
The normal form theorem, proved in R. Laver, On the left distributive law and the freeness of an algebra of elementary embeddings, Advances in Mathematics 91 (1992), 209-231, for the free algebra $\Cal A$ on one generator $x$ satisfying the…
A binary code is said to be a disjunctive list-decoding $s_L$-code, $s\ge1$, $L\ge1$, (briefly, LD $s_L$-code) if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets can cover not…
In connection with the emerging theory of Garside categories, we develop the notions of a left-Garside category and of a locally left-Garside monoid. In this framework, the connection between the self-distributivity law LD and braids…
We describe a solution of the word problem in free fields (coming from non-commutative polynomials over a commutative field) using elementary linear algebra, provided that the elements are given by minimal linear representations. It relies…
This paper gives necessary and sufficient conditions that the free product with amalgamation of circularly-ordered groups admit a circular ordering extending the given orderings of the factors. Our result follows from establishing a…
We construct a bireversible self-dual automaton with $3$ states over an alphabet with $3$ letters which generates the lamplighter group $\mathbb{Z}_3\wr\mathbb{Z}$.