Results 81 to 90 of about 158 (109)
Existence Results for a Class of Semilinear Elliptic Systems
, 2020 . In this paper, we study the existence of nontrivial solutions for the problem where Ω is bounded domain in R N and h 1 ,h 2 ∈ L 2 (Ω). The existence result is obtained by using the Leray-Schauder degree under the following condition on the ...
Moussaoui Abdelkrim, Khodja Brahim
core
Computational validations of the asymptotic matching conjectures
, 2005 We describe several computational validations of the asymptotic matching conjectures for r-regular bipartite graphs. These validations are based on algorithms for computation of d-dimensional monomerdimer entropies in statistical mechanics and asymptotic
S Friedland +3 more
core
On the sum relation of multiple Hurwitz zeta functions
, 2019 In this paper we shall define the special-valued multiple Hurwitz zeta functions, namely the multiple t-values t(α) and define similarly the multiple star t-values as t⋆(α). Then we consider the sum of all such multiple (star) t-values of fixed depth and
Chung, Chan-Liang
core
Some theorems on the q-analogue of the generalized stirling numbers
, 2011 In this paper, we establish more properties for the q-analogue of the unied generalization of Stirling numbers including the vertical and horizontal recurrence relations, and the rational generating function.
Husna Zayadi
core
Labeling regions in deformations of graphical arrangements
Combining Carver's variant of the Farkas' lemma with the Flow Decomposition Theorem we show that the regions of any deformation of a graphical arrangement may be bijectively labeled with a set of weighted digraphs containing directed cycles of negative ...
Hetyei, Gábor
core +1 more source
A combinatorial proof of a result for permutation pairs
Open Mathematics, 2012 Mansour Toufik, Shattuck Mark
doaj +1 more source
Parity-alternating permutations and successions
Open Mathematics, 2014 Munagi Augustine
doaj +1 more source
Some enumerative properties of parking functions
A parking function is a sequence \((\pi_1,\dots, \pi_n)\) of positive integers such that if \(\lambda_1\leq\cdots\leq \lambda_n\) is the increasing rearrangement of \(\pi_1,\dots,\pi_n\), then \(\lambda_i\leq i\) for \(1\leq i\leq n\).
Stanley, Richard P, Yin, Mei
core
Capacities: From Information Theory to Extremal Set Theory
Generalizing the concept of zero--error capacity beyond its traditional links to any sort of information transmission we give an asymptotic solution to several hard problems in extremal set theory within a unified, formally information--theoretic ...
J. Körner, L. Gargano, U. Vaccaro
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Are the Catalan Numbers a Linear Recurrence Sequence?
American Mathematical Monthly, 2022Martin Klazar
exaly