Results 61 to 70 of about 3,173 (190)
Application of graph combinatorics to rational identities of type $A^\ast$ [PDF]
To a word $w$, we associate the rational function $\Psi_w = \prod (x_{w_i} - x_{w_{i+1}})^{-1}$. The main object, introduced by C. Greene to generalize identities linked to Murnaghan-Nakayama rule, is a sum of its images by certain permutations of the ...
Adrien Boussicault, Valentin Féray
doaj +1 more source
Schur-positivity via products of grid classes [PDF]
Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur- positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets and multisets,
Sergi Elizalde, Yuval Roichman
doaj +1 more source
Updating the Incomplete MOLS Table for v $v$ up to 100
ABSTRACT Incomplete transversal designs have wide application in the construction of other designs such as transversal designs, block designs, frames, statistical designs, and Latin rectangles. Other areas where they are used include telecommunications and network codes, obtaining physically unclonable functions, frequency hopping sequences and ...
R. Julian R. Abel +2 more
wiley +1 more source
Saturated Partial Embeddings of Planar Graphs
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source
Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs
ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho +3 more
wiley +1 more source
The 1 3 $\frac{1}{3}$‐Conjectures for Domination in Cubic Graphs
ABSTRACT A set S $S$ of vertices in a graph G $G$ is a dominating set of G $G$ if every vertex not in S $S$ is adjacent to a vertex in S $S$. The domination number of G $G$, denoted by γ ( G ) $\gamma (G)$, is the minimum cardinality among all dominating sets in G $G$. In a breakthrough paper in 2008, Löwenstein and Rautenbach proved that if G $G$ is a
Paul Dorbec, Michael A. Henning
wiley +1 more source
Unexpected Primes of Good Reduction in Quotients of Modular and Shimura Curves
ABSTRACT We find all zero‐dimensional spaces of newforms of weight 2 and squarefree level N$N$ with a fixed Atkin–Lehner sign pattern. As an application, we classify unexpected primes of good reduction of Atkin–Lehner quotients of modular and Shimura curves of squarefree levels.
Oana Padurariu +2 more
wiley +1 more source
Quasirandomness in discrete mathematics, additive combinatorics and group theory
The main objective of this bachelor's thesis will be to present the concept of quasirandomness in various mathematical contexts while proving all the pertinent results. We will introduce the results of Fan Chung and Ronald Graham on quasirandom graphs and quasirandom sets, and the results of Timothy Gowers on quasirandom groups.
openaire +2 more sources
Algorithmic complexity of protein identification: combinatorics of weighted strings [PDF]
Cieliebak M, Erlebach T, Lipták Z, Stoye J, Welzl E. Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics.
Lipták, Zsuzsanna +14 more
core +1 more source
Combinatorics of k-shapes and Genocchi numbers [PDF]
In this paper we present a work in progress on a conjectural new combinatorial model for the Genocchi numbers. This new model called irreducible k-shapes has a strong algebraic background in the theory of symmetric functions and leads to seemingly new ...
Florent Hivert, Olivier Mallet
doaj +1 more source

