Results 101 to 110 of about 809,033 (313)
On Hopf algebras with triangular decomposition
, 2018 In this survey, we first review some known results on the representation theory of algebras with triangular decomposition, including the classification of the simple modules. We then discuss a recipe to construct Hopf algebras with triangular decomposition.
openaire +4 more sources
Jordan maps on triangular algebras
Linear Algebra and its Applications, 2007 AbstractLet T be a triangular algebra and R′ be an arbitrary ring. Suppose that M:T→R′ and M∗:R′→T are surjective maps such thatM(aM∗(x)+M∗(x)a)=M(a)x+xM(a),M∗(M(a)x+xM(a))=aM∗(x)+M∗(x)afor all a∈T,x∈R′. In this paper, we give sufficient conditions on T such that both M and M∗ are additive. In particular, if T is a standard subalgebra of a nest algebra,
openaire +2 more sources
Representation dimensions of triangular matrix algebras
Linear Algebra and its Applications, 2013 19 ...
Shunhua Zhang, Hongbo Yin
openaire +3 more sources
The Discretization‐Corrected Particle Strength Method for the Barotropic Vorticity Equations
International Journal for Numerical Methods in Fluids, EarlyView.Numerical solution for the barotropic vorticity equation in complex geometry using the meshless point collocation method. The spatial domain is represented by a set of nodes. The collocation method numerically solves the strong form governing equations.
G. C. Bourantas +9 more
wiley +1 more source
Characterizations of generalized Lie n-higher derivations on certain triangular algebras
AIMS MathematicsThe aim of this paper was to provide a characterization of nonlinear generalized Lie $ n $-higher derivations for a certain class of triangular algebras. It was shown that, under some mild conditions, each component $ G_r $ of a nonlinear generalized Lie
He Yuan , Qian Zhang , Zhendi Gu
doaj +1 more source
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 +4 more
openaire +4 more sources
Perspective Projection of an Ellipse and an Ellipsoid for Analytical View Factor Evaluation
Heat Transfer, EarlyView.ABSTRACT Radiative view factors are fundamental quantities for evaluating radiative heat transfer between different surfaces. While analytical expressions of view factors have been evaluated for various types of basic geometries, including circular disks and spheres, extending these solutions to more complex geometries, such as ellipses and ellipsoids ...
Kaname Sasaki
wiley +1 more source
Enumeration and Construction of Row‐Column Designs
Journal of Combinatorial Designs, EarlyView.ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger +3 more
wiley +1 more source
Solvability of a Bounded Parametric System in Max-Łukasiewicz Algebra
Mathematics, 2020 The max-Łukasiewicz algebra describes fuzzy systems working in discrete time which are based on two binary operations: the maximum and the Łukasiewicz triangular norm.
Martin Gavalec, Zuzana Němcová
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 +2 more
wiley +1 more source