Results 101 to 110 of about 205,279 (307)

Complexity of triangular representations of algebraic sets

Journal of Algebra, 2019
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the degrees of the polynomials and the number of components in the output of the algorithm, providing explicit ...
Eli Amzallag, Eli Amzallag, Thieu N. Vo, Gleb Pogudin, Mengxiao Sun   +4 more
openaire   +4 more sources

Implication of the order of blending and tuning when computing the genomic relationship matrix in single‐step GBLUP

Journal of Animal Breeding and Genetics, Volume 140, Issue 1, Page 60-78, January 2023., 2023
Abstract Single‐step genomic BLUP (ssGBLUP) relies on the combination of the genomic (G$$ \mathbf{G} $$) and pedigree relationship matrices for all (A$$ \mathbf{A} $$) and genotyped (A22$$ {\mathbf{A}}_{22} $$) animals. The procedure ensures G$$ \mathbf{G} $$ and A22$$ {\mathbf{A}}_{22} $$ are compatible so that both matrices refer to the same genetic ...
Taylor M. McWhorter, Matias Bermann, Andre L. S. Garcia, Andrés Legarra, Ignacio Aguilar, Ignacy Misztal, Daniela Lourenco   +6 more
wiley   +1 more source

Ternary mappings of triangular algebras [PDF]

arXiv, 2019
We take a categorical approach to describe ternary derivations and ternary automorphisms of triangular algebras. New classes of automorphisms and derivations of triangular algebras are also introduced and studied.
arxiv  

Ore Extensions and Infinite Triangularization [PDF]

arXiv, 2020
We give infinite triangularization and strict triangularization results for algebras of operators on infinite dimensional vector spaces. We introduce a class of algebras we call Ore-solvable algebras: these are similar to iterated Ore extensions but need not be free as modules over the intermediate subrings.
arxiv  

The Generic Circular Triangle‐Free Graph

Journal of Graph Theory, EarlyView.
ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 ${{\mathbb{C}}}_{3}$ and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G $G$ embeds into C 3 ${{\mathbb{C}}}_{3}$ if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 } $\{{K}_{3},{K}_{1}+2{
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley   +1 more source

On generalized biderivations of Banach algebras

AIMS Mathematics
The aim of this paper is to introduce the concept of generalized biderivations of unital Banach algebras and prove some results concerning generalized biamenability of unital Banach algebras.
Berna Arslan
doaj   +1 more source

Gorenstein defect categories of triangular matrix algebras [PDF]

arXiv, 2014
We apply the technique of recollement to study the Gorenstein defect categories of triangular matrix algebras. First, we construct a left recollement of Gorenstein defect categories for a triangular matrix algebra under some conditions, using it, we give a categorical interpretation of the Gorenstein properties of the triangular matrix algebra obtained
arxiv  

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem

Journal of Graph Theory, EarlyView.
ABSTRACT Given a hypergraph H ${\rm{ {\mathcal H} }}$, the dual hypergraph of H ${\rm{ {\mathcal H} }}$ is the hypergraph of all minimal transversals of H ${\rm{ {\mathcal H} }}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another.
Endre Boros, Vladimir Gurvich, Martin Milanič, Yushi Uno   +3 more
wiley   +1 more source

Non-Abelian symmetries of the half-infinite XXZ spin chain

Nuclear Physics B, 2017
The non-Abelian symmetries of the half-infinite XXZ spin chain for all possible types of integrable boundary conditions are classified. For each type of boundary conditions, an analog of the Chevalley-type presentation is given for the corresponding ...
Pascal Baseilhac, Samuel Belliard
doaj   +1 more source

Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh, Domagoj Bradač, Bernard Lidický   +2 more
wiley   +1 more source