Results 21 to 30 of about 270,762 (116)
Chutes and Ladders with Large Spinners
, 2014 We prove a conjecture from a 2011 College Mathematics Journal article addressing the expected number of turns in a Chutes and Ladders game when the spinner range is close to the length of the board.
Connors, Darcie E., Glass, Darren B.
core +1 more source
Putatively Optimal Projective Spherical Designs With Little Apparent Symmetry
Journal of Combinatorial Designs, EarlyView.ABSTRACT We give some new explicit examples of putatively optimal projective spherical designs, that is, ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in general, which requires the introduction of new techniques for their construction.
Alex Elzenaar, Shayne Waldron
wiley +1 more source
Catalan Traffic and Integrals on the Grassmannians of Lines
, 2007 We prove that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen (Catlan Traffic at the Beach, The Electronic Journal of Combinatorics, 9, (2002), 1--17), are top intersection numbers in the cohomology ring of the ...
Fulton +6 more
core +1 more source
On the existence of block-transitive combinatorial designs [PDF]
, 2010 Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and ...
Huber, Michael
core +4 more sources
, 2007 Coding theory lies naturally at the intersection of a large number of disciplines in pure and applied mathematics: algebra and number theory, probability theory and statistics, communication theory, discrete mathematics and combinatorics, complexity ...
core +2 more sources
Independent Sets of Random Trees and Sparse Random Graphs
Journal of Graph Theory, EarlyView.ABSTRACT An independent set of size k $k$ in a finite undirected graph G $G$ is a set of k $k$ vertices of the graph, no two of which are connected by an edge. Let xk ( G ) ${x}_{k}(G)$ be the number of independent sets of size k $k$ in the graph G $G$ and let α ( G ) = max { k ≥ 0 : x k ( G ) ≠ 0 } $\alpha (G)=\max \{k\ge 0:{x}_{k}(G)\ne 0\}$. In 1987,
Steven Heilman
wiley +1 more source
Some problems in mathematics and mathematical physics [PDF]
arXiv, 2020 We discuss new approaches to fundamental problems of mathematics and mathematical physics such as mathematical foundation of quantum field theory, the Riemann hypothesis, and construction of noncommutative algebraic geometry.
arxiv
Some remarks on multiplicity codes
, 2014 Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives.
Kopparty, Swastik
core +1 more source
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
Journal of Graph Theory, EarlyView.ABSTRACT Given a hypergraph H ${\rm{ {\mathcal H} }}$, the dual hypergraph of H ${\rm{ {\mathcal H} }}$ is the hypergraph of all minimal transversals of H ${\rm{ {\mathcal H} }}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another.
Endre Boros +3 more
wiley +1 more source
Mathematical Methods in the Applied Sciences, EarlyView.ABSTRACT The motivation of this paper is to explore and generalize Sakaguchi‐type functions, which play a significant role in geometric function theory. In this context, we introduce four new classes of analytic univalent functions: ℑΨ,tb,α,ρ,ℑϑb,α,ρ,ℑΘ,mb,α,ρ$$ {\Im}_{\Psi, t}^{b,\alpha, \rho },\kern0.3em {\Im}_{\vartheta}^{b,\alpha, \rho },\kern0.3em
Arzu Akgül
wiley +1 more source