Results 81 to 90 of about 1,343 (197)
χ*-Extremal Graphs and the Lexicographic Product [PDF]
, 1994 The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinary chromatic number of a graph. We say a graph G is χ*-extremal if its star-chromatic number is equal to its fractional-chromatic number.
Guogang Gao, Xuding Zhu
core
Randomized Algorithms for Streaming Low‐Rank Approximation in Tree Tensor Network Format
Numerical Linear Algebra with Applications, Volume 33, Issue 4, August 2026.ABSTRACT In this work, we present the tree tensor network Nyström (TTNN), an algorithm that extends recent research on streamable tensor approximation, such as for Tucker and tensor‐train formats, to the more general tree tensor network format, enabling a unified treatment of various existing methods.
Alberto Bucci, Gianfranco Verzella
wiley +1 more source
Lexicographic Cones and the Ordered Projective Tensor Product [PDF]
, 2019 We introduce lexicographic cones, a method of assigning an ordered vector space Lex(S) to a poset S, generalising the standard lexicographic cone. These lexicographic cones are then used to prove that the projective tensor cone of two arbitrary cones is ...
Marten Wortel, Wortel, Marten
core +1 more source
Fine multidegrees, universal Gröbner bases, and matrix Schubert varieties
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract We give a criterion for a collection of polynomials to be a universal Gröbner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in (P1)N$(\mathbb {P}^1)^N$. This criterion can be used to give simple proofs of several existing results on universal Gröbner bases.
Daoji Huang, Matt Larson
wiley +1 more source
Spin‐s$s$ U(1)$U(1)$‐Eigenstate Preparation
Annalen der Physik, Volume 538, Issue 7, July 2026.A Gray code for bounded integer compositions, together with Gray gates (shown below), are used to prepare general U(1)‐eigenstates of a spin‐s chain. ABSTRACT We formulate a deterministic algorithm for preparing a general U(1)$U(1)$‐eigenstate of a spin‐s$s$ chain of length n$n$. These states consist of linear combinations of computational basis states
Nabi Zare Harofteh, Rafael I. Nepomechie
wiley +1 more source
Lexicographic products with high reconstruction numbers
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard C. Brewster +3 more
openaire +1 more source
On the Roman domination in the lexicographic product of graphs [PDF]
, 2015 A Roman dominating function of a graph ▫$G = (V,E)$▫ is a function ▫$f colon V to {0,1,2}$▫ such that every vertex with ▫$f(v) = 0$▫ is adjacent to some vertex with ▫$f(v) = 2$▫. The Roman domination number of ▫$G$▫ is the minimum of ▫$w(f) = sum_{v in V}
Repolusk, Polona +2 more
core
A Shallow Echo: Artificial Intelligence and the Semantic Flattening of the Qur'an
Learned Publishing, Volume 39, Issue 3, July 2026.ABSTRACT Scriptural Arabic relies on highly intentional word choices, employing apparent synonyms and near‐synonyms that convey distinct semantic values based on their specific textual placement. Historically, computational translation has struggled to reproduce these precise textual boundaries. Addressing this issue, the present investigation assesses
Ekrema Shehab
wiley +1 more source
The irregularity of graphs under graph operations
Discussiones Mathematicae Graph Theory, 2014 The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj +1 more source
Another H-super magic decompositions of the lexicographic product of graphs
Indonesian Journal of Combinatorics, 2018 Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combination between graph decomposition and graph labeling. A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bijection
H Hendy +3 more
doaj +1 more source