Results 1 - 10 of 84

Topological obstructions for vertex numbers of Minkowski sums

by Raman Sanyal , 2007
"... We show that for polytopes P1, P2,..., Pr ⊂ Rd, each having ni ≥ d + 1 vertices, the Minkowski sum P1 + P2 + · · · + Pr cannot achieve the maximum of ∏ i ni vertices if r ≥ d. This complements a recent result of Fukuda & Weibel (2006), who show that this is possible for up to d − 1 summands. T ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
We show that for polytopes P1, P2,..., Pr ⊂ Rd, each having ni ≥ d + 1 vertices, the Minkowski sum P1 + P2 + · · · + Pr cannot achieve the maximum of ∏ i ni vertices if r ≥ d. This complements a recent result of Fukuda & Weibel (2006), who show that this is possible for up to d − 1 summands

Probing the WWγ vertex at hadron colliders

by Joannis Papavassiliou A , 1999
"... We present a new, model independent method for extracting bounds for the anomalous γWW couplings from hadron collider experiments. At the partonic level we introduce a set of three observables which are constructed from the unpolarized differential cross-section for the process dū → W − γ by appropr ..."
Abstract - Add to MetaCart
to somewhat more elaborate techniques, such as the binning of events according to their longitudinal momenta. PACS numbers: 13.40.Gp, 13.85.Ni, 14.70.Bh, 14.70.Fm 1 1

A Dyson-Schwinger study of the four-gluon vertex

by B Lorenz Von Smekala
"... Abstract: We present a self-consistent calculation of the four-gluon vertex of Landau gauge Yang-Mills theory from a truncated Dyson-Schwinger equation. The equation contains the leading diagrams in the ultraviolet and is solved using as the only input results for lower Green functions from previous ..."
Abstract - Add to MetaCart
Abstract: We present a self-consistent calculation of the four-gluon vertex of Landau gauge Yang-Mills theory from a truncated Dyson-Schwinger equation. The equation contains the leading diagrams in the ultraviolet and is solved using as the only input results for lower Green functions from

crystal limit of the Uqŝl(2)-vertex model

by Noncommutative Schur Polynomials, Christian Korff , 2010
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

A note on Arbitrarily vertex decomposable graphs, Opuscula Mathematica 26

by Antoni Marczyk , 2006
"... A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1,...,nk) of positive integers such that n1 +... + nk = n there exists a partition (V1,...,Vk) of the vertex set of G such that for each i ∈ {1,...,k}, Vi induces a connected subgraph of G on ni vertices. In th ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1,...,nk) of positive integers such that n1 +... + nk = n there exists a partition (V1,...,Vk) of the vertex set of G such that for each i ∈ {1,...,k}, Vi induces a connected subgraph of G on ni vertices

Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes (Extended Abstract)

by E. F. Brickell, D. R. Stinson , 1998
"... this paper, graphs do not have loops or multiple edges; a graph with multiple edges will be termed a multigraph. If G is a graph, we denote the vertex set of G by V(G) and the edge set by E(G). G is connected if any two vertices are joined by a path. The complete graph Kn is the graph on n vertices ..."
Abstract - Cited by 55 (4 self) - Add to MetaCart
in which any two vertices are joined t by an edge. The complete multipartite graph Knl,n 2 ..... at is a graph on ' ni vertices, in which i=l the vertex set is partitioned into subsets of size ni (1 < i < t), such that vw is an edge if and only if v and w are in different subsets

Thulium nickel/lithium distannide, TmNi1xLixSn2 (x = 0.035)

by Andrij Stetskiv, A Ivan Tarasiuk, B Renata Misztalc, Volodymyr Pavlyukb C , 2013
"... disorder in main residue; R factor = 0.026; wR factor = 0.060; data-to-parameter ratio = 17.2. The quaternary thulium nickel/lithium distannide, TmNi1x-LixSn2 (x = 0.035), crystallizes in the orthorhombic LuNiSn2 structure type. The asymmetric unit contains three Tm sites, six Sn sites, two Ni sites ..."
Abstract - Add to MetaCart
sites and one Ni/Li site [relative occupancies = 0.895 (8):0.185 (8)]. Site symmetries are.m. for all atoms. The 17-, 18- and 19-vertex distorted pseudo-Frank–Kasper polyhedra are typical for all Tm atoms. Four Sn atoms are enclosed in a 12-vertex deformed cubooctahedron, and another Sn atom is enclosed

Hoffman-Singleton Graph Elena Ortega Fall 2007 MATH 6023 Topics: Design and Graph Theory

by Properties Hoffman-singleton
"... If we consider a specified vertex in a graph with order n, degree d, and diameter k, and let ni be the number of vertices at a distance of i edges from that vertex, then the following inequality (from Moore, used by Hoffman and Singleton [7], and Miller and Siran [11]) holds: ni ≤ d(d – 1) i- 1 (1) ..."
Abstract - Add to MetaCart
If we consider a specified vertex in a graph with order n, degree d, and diameter k, and let ni be the number of vertices at a distance of i edges from that vertex, then the following inequality (from Moore, used by Hoffman and Singleton [7], and Miller and Siran [11]) holds: ni ≤ d(d – 1) i- 1 (1

Supersaturated graphs and hypergraphs

by Paul Erdős, Miklós Simonovits - Combinatorica , 1983
"... We shall consider graphs (hypergraphs) without loops and multiple edges. Let Ybe a family of so called prohibited graphs and ex (n, Y) denote the maximum number of edges (hyperedges) a graph (hypergraph) on n vertices can have without containing subgraphs from Y A graph (hypergraph) will be called s ..."
Abstract - Cited by 38 (0 self) - Add to MetaCart
-tuples, which have at most one vertex in each C i. For h=2 KP (ni l,..., nt p) is the ordinary complete p-partite graph. In some of our assertions we shall say e.g. that &quot;changing o(nl) edges in G &quot;... &quot;. (Of course, o(-) cannot be applied to one graph.) As a matter of fact

A SHARP LOWER BOUND OF THE SPECTRAL RADIUS OF SIMPLE GRAPHS

by Shengbiao Hu , 2009
"... Let G be a simple connected graph with n vertices and let ρ(G) be its spectral radius. The 2-degree of vertex i is denoted by ti, which is the sum of degrees of the vertices adjacent to i. Let Ni = ∑ tj and Mi = ∑ Nj. We find a sharp lower bound of ρ(G), which only contains two parameter Ni and Mi. ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Let G be a simple connected graph with n vertices and let ρ(G) be its spectral radius. The 2-degree of vertex i is denoted by ti, which is the sum of degrees of the vertices adjacent to i. Let Ni = ∑ tj and Mi = ∑ Nj. We find a sharp lower bound of ρ(G), which only contains two parameter Ni and Mi
Results 1 - 10 of 84