Search
Search Results
-
Automorphisms, Derivations and Gradings of the Split Quartic Cayley Algebra
The split quartic Cayley algebra is a structurable algebra which has been used to give constructions of Lie algebras of type D4. Here, we calculate...
-
Non-Associative Algebras and Related Topics NAART II, Coimbra, Portugal, July 18–22, 2022
This proceedings volume presents a selection of peer-reviewed contributions from the Second Non-Associative Algebras and Related Topics (NAART II)...
-
-
Biderivations of Low-Dimensional Leibniz Algebras
In this paper we give a complete classification of the Leibniz algebras of biderivations of right Leibniz algebras of dimension up to three over a...
-
The Image of Polynomials in One Variable on the Algebra of \(3 \times 3\) Upper Triangular Matrices
We explicitly compute the image of a one-variable polynomial on the algebra of...
-
Schreier’s Type Formulae and Two Scales for Growth of Lie Algebras and Groups
Let G be a free group of rank n and \(H\subset G\)...
-
Universal Central Extensions of Compatible Leibniz Algebras
We show the interplay between compatible Leibniz algebras and compatible associative dialgebras by means of a commutative diagram. We construct a...
-
Simultaneous Orthogonalization of Inner Products Over Arbitrary Fields
We give necessary and sufficient conditions for a family of inner products in a finite-dimensional vector space V over an arbitrary field...
-
Okubo Algebras with Isotropic Norm
OkuboElduque, A. algebras form an important class of nonunital composition algebras of dimension 8. Contrary to what happens for unital composition...
-
Transitivity on Subclasses of Chordal Graphs
Let \(G=(V, E)\) be a graph, where V and E are...
-
Diverse Fair Allocations: Complexity and Algorithms
In this work, we initiate the study of diversity of solutions in the context of fair division of indivisible goods. In particular, we explore the...
-
5-List Coloring Toroidal 6-Regular Triangulations in Linear Time
We give an explicit procedure for 5-list coloring a large class of toroidal 6-regular triangulations in linear time. We also show that these graphs...
-
Graph Covering Using Bounded Size Subgraphs
A variant of graph covering problem demands to find a set of sub-graphs when the union of sub-graphs contain all the edges of G. Another variant of...
-
Axiomatic Characterization of the Toll Walk Function of Some Graph Classes
A toll walk \(W=w_1\dots w_k\) in a graph G is...
-
Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength
The maximum subgraph problem (MSP) of a graph is the estimation of the greatest number of edges in the induced subgraph of all subsets of the vertex...
-
Arbitrary-Oriented Color Spanning Region for Line Segments
Given a set of colored geometric objects, a color spanning region of a desired shape is a region (of that shape) that contains at least one object of...
-
Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs
A graph G is said to be a bisplit graph if its vertex set can be partitioned into a stable set and a complete bipartite graph. The minimum Steiner...
-
On Three Domination-Based Identification Problems in Block Graphs
The problems of determining the minimum-sized identifying, locating-dominating and open locating-dominating codes of an input graph are special...
-
Fault-Tolerant Dispersion of Mobile Robots
We consider the mobile robot dispersion problem in the presence of faulty robots (crash-fault). Mobile robot dispersion consists of...
-
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs
A proper k-vertex-coloring of a graph G is a neighbor-locating k-coloring if for each pair of vertices in the same color class, the sets of colors...