Results 31 to 40 of about 240,213 (310)
Topological Classification of Crystalline Insulators through Band Structure Combinatorics [PDF]
We present a method for efficiently enumerating all allowed, topologically distinct, electronic band structures within a given crystal structure in all physically relevant dimensions. The algorithm applies to crystals without time-reversal, particle-hole,
J. Kruthoff+4 more
semanticscholar +1 more source
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of ...
Sabrina Shena Sarasvati+2 more
doaj +1 more source
Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and ...
P. Flajolet, R. Sedgewick
semanticscholar +1 more source
On Proper (Strong) Rainbow Connection of Graphs
A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui+3 more
doaj +1 more source
Combinatorial optimization in networks with Shared Risk Link Groups [PDF]
The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the ...
David Coudert+3 more
doaj +1 more source
The combinatorics of Jeff Remmel [PDF]
We give a brief overview of the life and combinatorics of Jeff Remmel, a mathematician with successful careers in both logic and combinatorics.
arxiv
Newton polytopes in algebraic combinatorics [PDF]
A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally): skew Schur ...
C. Monical, Neriman Tokcan, A. Yong
semanticscholar +1 more source
Toric degenerations of Grassmannians and Schubert varieties from matching field tableaux
We study the combinatorics of Gr\"obner degenerations of Grassmannians and the Schubert varieties inside them. We provide a family of binomial ideals whose combinatorics is governed by tableaux induced by matching fields in the sense of Sturmfels and ...
Clarke, Oliver, Mohammadi, Fatemeh
core +1 more source
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs.
Krivelevich, Michael
core +1 more source
On interval number in cycle convexity [PDF]
Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo+3 more
doaj +1 more source