Results 101 to 110 of about 105,191 (283)

Saturation and Irredundancy for Spin(8)

, 2006
We explicitly calculate the triangle inequalities for the group PSO(8). Therefore we explicitly solve the eigenvalues of sum problem for this group (equivalently describing the side-lengths of geodesic triangles in the corresponding symmetric space for ...
Kapovich, Michael, Kumar, Shrawan, Millson, John J.   +2 more
core  

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr, Lan Anh Pham, Cyril Pujol, Huan Zhou   +3 more
wiley   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

Explainable human‐in‐the‐loop healthcare image information quality assessment and selection

CAAI Transactions on Intelligence Technology, EarlyView., 2023
Abstract Smart healthcare applications cannot be separated from healthcare data analysis and the interactive interpretability between data and model. A human‐in‐the‐loop active learning approach is introduced to reduce the cost of healthcare data labelling by evaluating the information quality of unlabelled medical data and then screening the high ...
Yang Li, Sezai Ercisli
wiley   +1 more source

Al-Khwârizmî's Place and Importance in the History of Mathematics

ITM Web of Conferences, 2018
The aim of this study is to introduce Muḥammad ibn Mûsâ al-Khwârizmî and his works in terms of history of mathematics and mathematics education. Muḥammad ibn Musa al-Khwârizmî an Iraqi Muslim scholar and it is the first of the Muslim mathematicians who ...
DURAN Serbay, SAMANCI Hüseyin
doaj   +1 more source

Management Control Systems, Bricolage, and Frugal Innovation: Effects on Value Creation in Startups With a Social Mission

Knowledge and Process Management, EarlyView.
ABSTRACT This study analyzes the effects of the management control systems (social networking and organic innovative culture), via bricolage and frugal innovation, in the social and economic value creation of startups with a social mission. Data from 118 Brazilian startups with a social mission were analyzed using structural equation modeling and fuzzy‐
Anderson Betti Frare, Ilse Maria Beuren
wiley   +1 more source

Arakelov Inequalities for a Family of Surfaces Fibered by Curves

Mathematics
The numerical invariants of a variation of Hodge structure over a smooth quasi-projective variety are a measure of complexity for the global twisting of the limit-mixed Hodge structure when it degenerates.
Mohammad Reza Rahmati
doaj   +1 more source

A highly accurate numerical method for solving boundary value problem of generalized Bagley‐Torvik equation

Mathematical Methods in the Applied Sciences, EarlyView.
A highly accurate numerical method is given for the solution of boundary value problem of generalized Bagley‐Torvik (BgT) equation with Caputo derivative of order 0<β<2$$ 0<\beta <2 $$ by using the collocation‐shooting method (C‐SM). The collocation solution is constructed in the space Sm+1(1)$$ {S}_{m+1}^{(1)} $$ as piecewise polynomials of degree at ...
Suzan Cival Buranay, Mtema James Chin, Nazim I. Mahmudov   +2 more
wiley   +1 more source