Results 111 to 120 of about 117,839 (222)
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source
On the bijectivity of the map $$\chi $$
Cryptography and CommunicationsAbstract We prove that for $$n>1$$ n > 1
Anna-Maurin Graner +3 more
openaire +2 more sources
Bijections behind the Ramanujan Polynomials
Advances in Applied Mathematics, 2001 The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper edges, without realizing the connection to the Ramanujan polynomials.
William Y. C. Chen, Victor J. W. Guo
openaire +3 more sources
On the Lang–Trotter conjecture for Siegel modular forms
Mathematika, Volume 72, Issue 3, July 2026.Abstract Let f$f$ be a genus‐two cuspidal Siegel eigenform. We prove an adelic open image theorem for the compatible system of Galois representations associated with f$f$, generalizing the results of Ribet and Momose for elliptic modular forms. Using this result, we investigate the distribution of the Hecke eigenvalues ap$a_p$ of f$f$, and obtain upper
Arvind Kumar, Moni Kumari, Ariel Weiss
wiley +1 more source
Eulerian digraphs and Dyck words, a bijection
, 2014 The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions.
Codara, Pietro +2 more
core
A Bijective Proof of Borchardt's Identity [PDF]
The Electronic Journal of Combinatorics, 2004 We prove Borchardt's identity $$\hbox{det}\left({1\over x_i-y_j}\right) \hbox{per}\left({1\over x_i-y_j}\right)= \hbox{det}\left({1\over(x_i-y_j)^2}\right)$$ by means of sign-reversing involutions.
openaire +2 more sources
A New Hilbert's Hotel Argument Against Past‐Eternalism
Analytic Philosophy, Volume 67, Issue 2, Page 145-153, June 2026.ABSTRACT This paper offers a new formulation of the “Hilbert's Hotel Argument” (HHA) which is superior to existing formulations because it (1) demonstrates that HH is logically impossible in the concrete world, (2) takes into account the need to consider the assumptions of HHA, and (3) offers a reply to an important objection concerning the validity of
Andrew Ter Ern Loke, Eli Haitov
wiley +1 more source
Bijection between 20-Dyck path and ternary tree [PDF]
Journal of Hebei University of Science and TechnologyIn order to expand the basic theory of Dyck path and ternary tree, the bijection and counting problems between the 20-Dyck path and the ternary tree with n inliers were studied.
Jiahe WANG +3 more
doaj +1 more source
Semigroup Forum, 1984 Conditions on a map \(f:L\to M\) from a lattice L to a lattice M are considered under which f is a homomorphism of lattices in the case when f is a bijection. The main result of the paper is the following Theorem 4. Let L and M be lattices and let f:\(L\to M\) be a bijection.
Johnson, J., Moss, K.
openaire +1 more source
Bulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.Abstract Given r⩾3$r \geqslant 3$, we prove that there exists λ>0$\lambda >0$ depending only on r$r$ so that if G$G$ is a metric graph of rank r$r$ with metric entropy 1, then there exists a proper subgraph H$H$ of G$G$ with metric entropy at least λ$\lambda$. This answers a question of the second two authors together with Rieck. We interpret this as a
Tawfiq Hamed, Tarik Aougab, Matt Clay
wiley +1 more source