Results 31 to 40 of about 2,025,014 (262)
Mathematics Turned Inside Out: The Intensive Faculty Versus the Extensive Faculty [PDF]
Higher Education, vol. 61, no. 6, pp. 693-720, 2011, 2011 Research universities in the United States have larger mathematics faculties outside their mathematics departments than inside. Members of this "extensive" faculty conduct most mathematics research, their interests are the most heavily published areas of mathematics, and they teach this mathematics in upper division courses independent of mathematics ...
arxiv +1 more source
Independent Sets of Random Trees and Sparse Random Graphs
Journal of Graph Theory, Volume 109, Issue 3, Page 294-309, July 2025.ABSTRACT An independent set of size k in a finite undirected graph G is a set of k vertices of the graph, no two of which are connected by an edge. Let x k ( G ) be the number of independent sets of size k in the graph G and let α ( G ) = max { k ≥ 0 : x k ( G ) ≠ 0 }. In 1987, Alavi, Malde, Schwenk, and Erdős asked if the independent set sequence x 0 (
Steven Heilman
wiley +1 more source
A Study On Combinatorics Indiscrete Mathematics
, 2018 {"references": ["1.\tArumugam. S & Isaac. A. T, \"Modern Algebra\", Scitech Publications Pvt. Ltd, Chennai. 2.\tLiu. C. L \"Elements of Discrete Mathematics\", MC Graw Hill, Internation Edition. 3.\tTremblay. J. P & Manohar. R, \"Discrete Mathematics Structure with application to computer science\", TMH Edition 1007. 4.\tVeerarajan.
G. Rajkumar, Dr. V. Ramadoss
openaire +2 more sources
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
Recent Trends in Combinatorics [PDF]
, 2016 Section 1: Extremal and Probabilistic Combinatorics -- Problems Related to Graph Indices in Trees -- The edit distance in graphs: methods, results and generalizations -- Repetitions in graphs and sequences -- On Some Extremal Problems for Cycles in ...
Beveridge, Andrew +5 more
core +3 more sources
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, EarlyView.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
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
An Introduction to Combinatorics via Cayley\u27s Theorem [PDF]
, 2022 In this paper, we explore some of the methods that are often used to solve combinatorial problems by proving Cayley’s theorem on trees in multiple ways. The intended audience of this paper is undergraduate and graduate mathematics students with little to
Willis, Jaylee
core +1 more source
Mathematical Methods in the Applied Sciences, Volume 48, Issue 8, Page 9241-9252, 30 May 2025.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