Related papers: Free augmented LD-systems
We call the family of free-by-cyclic groups defined by $G = \left< a, t, b_1, b_2, \ldots b_k \mid at = ta, b_1^{-1}tb_1 = a^{n_1}t, \ldots b_k^{-1}tb_k = a^{n_k}t \right>$ for $n_1, n_2, \ldots n_k \in \mathbb Z$ linearly mismatched since…
Let Z<X> be the free unitary associative ring freely generated by an infinite countable set X = {x_1, x_2,...}. Define a left-normed commutator [x_1, x_2, ..., x_n] by [a,b] = ab - ba, [a,b,c] = [[a,b],c]. For n \ge 2, let T^(n) be the…
In this paper, we propose an analysis mechanism based structured Analysis Discriminative Dictionary Learning (ADDL) framework. ADDL seamlessly integrates the analysis discriminative dictionary learning, analysis representation and analysis…
In this paper, we introduce the notion of Autometrized lattice ordered monoids (for short,AL-monoids) as a generalization to DRl-semi groups. We obtain the basic properties of AL-monoids. Also, we prove that Autometrized lattice ordered…
There is a notion of non-commutative Lie algebra called "Leibniz algebra", which is characterized by the condition: left bracketing is a derivation. The purpose of this article is to introduce and study a new notion of algebra, called…
Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.
In the 1970s, Williams developed an algorithm that has been used to construct and study modular links in the Lorenz template. We introduce an improved algorithm, which we call the bunch algorithm, to provide more insights into the geometry…
A group has normal rank (or weight) greater than one if no single element normally generates the group. The Wiegold problem from 1976 asks about the existence of a finitely generated perfect group of normal rank greater than one. We show…
The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…
In this paper we consider dimonoids, which are sets equipped with two associative binary operations. Dimonoids in the sense of J.-L. Loday are xamples of duplexes. The set of all permutations, gives an example of a duplex which is not a…
We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…
We consider the mixed problem for $L$ the Lam\'e system of elasticity in a bounded Lipschitz domain $ \Omega\subset\reals ^2$. We suppose that the boundary is written as the union of two disjoint sets, $\partial\Omega =D\cup N$. We take…
In the paper, we present the ADD-Lib, our efficient and easy to use framework for Algebraic Decision Diagrams (ADDs). The focus of the ADD-Lib is not so much on its efficient implementation of individual operations, which are taken by other…
The presence of integer variables in the European day-ahead electricity market renders the social welfare maximization problem non-convex and non-differentiable, making classical marginal pricing theoretically inconsistent. Existing pricing…
An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree…
A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…
Braided differential operators $\del^i$ are obtained by differentiating the addition law on the braided covector spaces introduced previously (such as the braided addition law on the quantum plane). These are affiliated to a Yang-Baxter…
In this paper, we establish a bijection between the infinite reduced words of an affine Weyl group and certain biclosed sets of its positive system and determine all finitely generated biclosed sets in the positive system of an affine Weyl…
Let $L$ be an algebra over a field $F$ with the binary operations $+$ and $[,]$. Then $L$ is called a left Leibniz algebra if it satisfies the left Leibniz identity: $[[a,b],c]=[a,[b,c]]-[b,[a,c]]$ for all elements $a,b,c\in L$. A linear…
In this paper we present complexity certification results for a distributed Augmented Lagrangian (AL) algorithm used to solve convex optimization problems involving globally coupled linear constraints. Our method relies on the Accelerated…