Results 11 to 20 of about 316,590 (267)
Littelmann paths and Brownian paths [PDF]
Duke Mathematical Journal, 2005 We study some path transformations related to Littelmann path model and their applications to representation theory and Brownian motion in a Weyl chamber.
Biane, Philippe +2 more
openaire +5 more sources
The Path to Path-Traced Movies [PDF]
Foundations and Trends® in Computer Graphics and Vision, 2016 Path tracing is one of several techniques to render photorealistic images by simulating the physics of light propagation within a scene. The roots of path tracing are outside of computer graphics, in the Monte Carlo simulations developed for neutron transport.
Per H. Christensen, Wojciech Jarosz
openaire +1 more source
Physical Review Letters, 2020 Main Text: 5 pages, 5 figures, 7 equations.
Mandelli, Davide +2 more
openaire +4 more sources
Finding an induced path that is not a shortest path [PDF]
Discrete Mathematics, 2021 We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
Eli Berger +2 more
openaire +3 more sources
Exact Values for Some Size Ramsey Numbers of Paths and Cycles
Frontiers in Physics, 2020 For the graphs G1, G2, and G, if every 2-coloring (red and blue) of the edges of G results in either a copy of blueG1 or a copy of redG2, we write G → (G1, G2).
Xiangmei Li +3 more
doaj +1 more source
On the Lettericity of Paths [PDF]
Australas. J Comb., 2020 Verifying a conjecture of Petkov{š}ec, we prove that the lettericity of an n-vertex path is precisely $\left\lfloor \frac{n+4}{3}\right\rfloor$.
openaire +3 more sources
Minimum path bases and relevant paths [PDF]
Networks, 2005 AbstractGiven an undirected graph G(V,E) and a vertex subset U ⊆ V the U‐space is the vector space over GF(2) spanned by the paths with end‐points in U and the cycles in G(V,E). We extend Vismara's algorithm to the computation of the union of all minimum length bases of the U‐space. Although the size distribution of subgraphs is the same in all minimum
Petra M. Gleiss +2 more
openaire +3 more sources
The Size, Multipartite Ramsey Numbers for nK2 Versus Path–Path and Cycle
Mathematics, 2021 For given graphs G1,G2,…,Gn and any integer j, the size of the multipartite Ramsey number mj(G1,G2,…,Gn) is the smallest positive integer t such that any n-coloring of the edges of Kj×t contains a monochromatic copy of Gi in color i for some i, 1≤i≤n ...
Yaser Rowshan +2 more
doaj +1 more source
Paths of specified length in random k-partite graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 Fix positive integers k and l. Consider a random k-partite graph on n vertices obtained by partitioning the vertex set into V_i, (i=1, \ldots,k) each having size Ω (n) and choosing each possible edge with probability p.
C.R. Subramanian
doaj +1 more source
Mathematics can be meaningful, easy and fun
LUMAT, 2015 The negative attitudes are easily growing among children when mothers are telling to their daughters they were not good at mathematics or when newspapers’ cartoonist is drawing jokes about bad mathematics memories at school.
Maarit Rossi
doaj +1 more source