Results 91 to 100 of about 145,190 (272)
Combinatorics of diagrams of permutations [PDF]
There are numerous combinatorial objects associated to a Grassmannian permutation $w_λ$ that index cells of the totally nonnegative Grassmannian. We study some of these objects (rook placements, acyclic orientations, various restricted fillings) and their q-analogues in the case of permutations $\mathcal{w}$ that are not necessarily Grassmannian.
Alejandro H. Morales+1 more
openaire +6 more sources
Normal covering numbers for Sn$S_n$ and An$A_n$ and additive combinatorics
Abstract The normal covering number γ(G)$\gamma (G)$ of a noncyclic group G$G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for γ(Sn)$\gamma (S_n)$ and γ(An)$\gamma (A_n)$ depending on the arithmetic structure of n$n$. In particular we determine the limsups over γ(Sn)/n$\gamma (S_n) / n$ and γ(An)
Sean Eberhard, Connor Mellon
wiley +1 more source
Continuous dependence and differentiation of solutions of finite difference equations
Conditions are given for the continuity and differentiability of solutions of initial value problems and boundary value problems for the nth order finite difference equation, u(m+n)=f(m,u(m),u(m+1),…,u(m+n−1)),m∈ℤ.
Johnny Henderson, Linda Lee
doaj +1 more source
The Combinatorics of Iterated Loop Spaces
It is well known since Stasheff's work that 1-fold loop spaces can be described in terms of the existence of higher homotopies for associativity (coherence conditions) or equivalently as algebras of contractible non-symmetric operads.
Batanin, M. A.
core +1 more source
Combinatorics of Chord Progressions [PDF]
Color poster with text and diagrams.This study explored an overlap between combinatorics and music. The goal was to show chord progressions that are common to a specific collection of music, composer, or era.University of Wisconsin--Eau Claire Office of
Kiefer, Peter
core +1 more source
Indiscernibles in monadically NIP theories
Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
wiley +1 more source
Graphs with 4-Rainbow Index 3 and n − 1
Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G),
Li Xueliang+3 more
doaj +1 more source
Estimates on the decay of the Laplace–Pólya integral
Abstract The Laplace–Pólya integral, defined by Jn(r)=1π∫−∞∞sincntcos(rt)dt$J_n(r) = \frac{1}{\pi }\int _{-\infty }^\infty \operatorname{sinc}^n t \cos (rt) \,\mathrm{d}t$, appears in several areas of mathematics. We study this quantity by combinatorial methods; accordingly, our investigation focuses on the values at integer rs$r{\rm s}$.
Gergely Ambrus, Barnabás Gárgyán
wiley +1 more source
The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let Pk denote the path on k vertices and let mPk denote m disjoint copies of Pk.
Lan Yongxin, Qin Zhongmei, Shi Yongtang
doaj +1 more source
: This study described undergraduate students’ gesture in problem solving based on the stage of thinking by Mason which consisted of the stage of entry, attack, and review. The study adopted descriptive qualitative approach. Subjects were chosen based on
Mei Radia Putri+2 more
doaj +1 more source