Results 11 to 20 of about 419,531 (350)
Monochromatic Triangles, Triangle Listing and APSP [PDF]
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020 To appear in FOCS ...
Williams, Virginia Vassilevska +1 more
openaire +4 more sources
A second look at counting triangles in graph streams [PDF]
Theoretical Computer Science, 2014 In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs withm edges and at leastT triangles, we show that an extra look over the stream yields a two-pass streaming algorithm that uses O( m 4:5 p ...
Graham Cormode, H. Jowhari
semanticscholar +3 more sources
Generalized monotone triangles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 In a recent work, the combinatorial interpretation of the polynomial $\alpha (n; k_1,k_2,\ldots,k_n)$ counting the number of Monotone Triangles with bottom row $k_1 < k_2 < ⋯< k_n$ was extended to weakly decreasing sequences $k_1 ≥k_2 ≥⋯≥k_n$.
Lukas Riegler
doaj +2 more sources
Fixed point theorem for mappings contracting perimeters of triangles [PDF]
Journal of Fixed Point Theory and Applications, 2023 We consider a new type of mappings in metric spaces which can be characterized as mappings contracting perimeters of triangles. It is shown that such mappings are continuous.
E. Petrov
semanticscholar +1 more source
Counting substructures and eigenvalues I: Triangles [PDF]
European journal of combinatorics (Print), 2021 Motivated by the counting results for color-critical subgraphs by Mubayi [Adv. Math., 2010], we study the phenomenon behind Mubayi's theorem from a spectral perspective and start up this problem with the fundamental case of triangles.
Bo Ning, M. Zhai
semanticscholar +1 more source
Leptonic unitarity triangles [PDF]
Physical Review D, 2020 We present a comprehensive analysis of leptonic unitarity triangles, using both current neutrino oscillation data and projections of next-generation oscillation measurements.
S. Ellis, K. Kelly, S. Li
semanticscholar +1 more source
Eigenvalues and triangles in graphs [PDF]
Combinatorics, probability & computing, 2019 Bollobás and Nikiforov (J. Combin. Theory Ser. B. 97 (2007) 859–865) conjectured the following. If G is a Kr+1-free graph on at least r+1 vertices and m edges, then ${\rm{\lambda }}_1^2(G) + {\rm{\lambda }}_2^2(G) \le (r - 1)/r \cdot 2m$, where λ1 (G)and
Huiqiu Lin, Bo Ning, Baoyindureng Wu
semanticscholar +1 more source
Euclidean triangles have no hot spots [PDF]
Annals of Mathematics, 2018 We show that a second Neumann eigenfunction u of a Euclidean triangle has at most one (nonvertex) critical point p, and if p exists, then it is a non-degenerate critical point of Morse index 1.
C. Judge, Sugata Mondal
semanticscholar +1 more source
Center for Educational Policy Studies Journal, 2018 This paper synthesises research from three separate studies, analysing how different representations of a mathematical concept may affect young children's engagement with mathematical activities.
Dina Tirosh +3 more
doaj +1 more source
Dissection of a Triangle into Similar Triangles [PDF]
Discrete & Computational Geometry, 2005 For \(n\geq 2\), let \(f(n)\) be the number of triangles that can be dissected into \(n\) similar nonright triangles, and let \(g(n)\) be the number of nonsimilar nonright triangles \(T\) that can be dissected into \(n\) parts similar to \(T\). It follows from an example of \textit{H. Kaiser} [Elem. Math. 46, 106--111 (1991; Zbl 0744.05004)] that \(f(n)
openaire +2 more sources