Results 21 to 30 of about 232,590 (215)
Manifolds of mappings on Cartesian products [PDF]
Annals of Global Analysis and Geometry, 2022 AbstractGiven smooth manifolds $$M_1,\ldots , M_n$$ M 1 , … , M n ...
Helge Glöckner, Alexander Schmeding
openaire +3 more sources
The localization game on Cartesian products [PDF]
Discrete Applied Mathematics, 2021 The localization game is played by two players: a Cop with a team of $k$ cops, and a Robber. The game is initialised by the Robber choosing a vertex $r \in V$, unknown to the Cop. Thereafter, the game proceeds turn based. At the start of each turn, the Cop probes $k$ vertices and in return receives a distance vector.
Jeandré Boshoff, Adriana Roux
openaire +3 more sources
Turing instabilities on Cartesian product networks. [PDF]
Sci Rep, 2015 AbstractThe problem of Turing instabilities for a reaction-diffusion system defined on a complex Cartesian product network is considered. To this end we operate in the linear regime and expand the time dependent perturbation on a basis formed by the tensor product of the eigenvectors of the discrete Laplacian operators, associated to each of the ...
Asllani M +4 more
europepmc +9 more sources
On the Gonality of Cartesian Products of Graphs [PDF]
The Electronic Journal of Combinatorics, 2020 In this paper we provide the first systematic treatment of Cartesian products of graphs and their divisorial gonality, which is a tropical version of the gonality of an algebraic curve defined in terms of chip-firing. We prove an upper bound on the gonality of the Cartesian product of any two graphs, and determine instances where this bound holds with
Ralph Morrison, Ivan Aidun
openaire +3 more sources
The Cartesian product of hypergraphs [PDF]
Journal of Graph Theory, 2011 AbstractWe show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a unique prime factor decomposition with respect to the (weak) Cartesian product, even if it has infinitely many factors. This generalizes previous results for graphs and undirected hypergraphs to directed and infinite hypergraphs. The proof adopts the
Marc Hellmuth +2 more
openaire +3 more sources
On density of subgraphs of Cartesian products [PDF]
Journal of Graph Theory, 2019 AbstractIn this paper, we extend two classical results about the density of subgraphs of hypercubes to subgraphs of Cartesian products of arbitrary connected graphs. Namely, we show that , where is the maximum ratio taken over all subgraphs of .
Chepoi, Victor +2 more
openaire +4 more sources
Cartesian products as profinite completions [PDF]
International Mathematics Research Notices, 2006 We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups under some natural restrictions.
Kassabov, M, Nikolov, N
openaire +4 more sources
On Cartesian Products of Signed Graphs [PDF]
Discrete Applied Mathematics, 2020 In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main results is the unicity of the prime factor decomposition of signed graphs.
openaire +4 more sources
On Well-Covered Cartesian Products [PDF]
Graphs and Combinatorics, 2018 12 pages, 2 ...
Bert L. Hartnell +2 more
openaire +3 more sources
Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms [PDF]
, 2013 It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time.
Hellmuth, Marc +2 more
core +1 more source