Results 81 to 90 of about 2,700,684 (210)
PDE Approaches to Graph Analysis [PDF]
arXiv, 2015 This paper surveys and discusses recent work adapting partial differential equation (PDE) models to discrete structures.
arxiv
Putatively Optimal Projective Spherical Designs With Little Apparent Symmetry
Journal of Combinatorial Designs, Volume 33, Issue 6, Page 222-234, June 2025.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
A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We are interested in fixed points in Boolean networks, $\textit{i.e.}$ functions $f$ from $\{0,1\}^n$ to itself. We define the subnetworks of $f$ as the restrictions of $f$ to the hypercubes contained in $\{0,1\}^n$, and we exhibit a class $\mathcal{F ...
Adrien Richard
doaj +1 more source
Discrete model of Yang-Mills equations in Minkowski space [PDF]
Cubo A Mathematical Journal, Vol. 6, No. 2 (2004), pp. 35-50, 2004 Using methods of differential geometry, a discrete analog of the Yang-Mills equations in Minkowski space is constructed. The gauge transformation law in a discrete formulation is given and gauge invariance of discrete Yang-Mills equations is studied. Difference self-dual and anti-self-dual equations with respect to the Lorentz metric are presented.
arxiv
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
Pattern avoidance in dynamical systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Orbits generated by discrete-time dynamical systems have some interesting combinatorial properties. In this paper we address the existence of forbidden order patterns when the dynamics is generated by piecewise monotone maps on one-dimensional closed ...
José María Amigó +2 more
doaj +1 more source
Complexity problems in enumerative combinatorics [PDF]
arXiv, 2018 We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
arxiv
Positive Co‐Degree Turán Number for C5 and C5−
Journal of Graph Theory, Volume 109, Issue 1, Page 25-30, May 2025.ABSTRACT The minimum positive co‐degree δ r − 1 + ( H )
The Moran Process on a Random Graph
Random Structures &Algorithms, Volume 66, Issue 3, May 2025.ABSTRACT We study the fixation probability for two versions of the Moran process on the random graph Gn,p$$ {G}_{n,p} $$ at the threshold for connectivity. The Moran process models the spread of a mutant population in a network. Throughout the process, there are vertices of two types, mutants, and non‐mutants.
Alan Frieze, Wesley Pegden
wiley +1 more source
On the critical exponent of generalized Thue-Morse words [PDF]
Discrete Mathematics and Theoretical Computer Science 9 (2007)
293-304, 2007 For certain generalized Thue-Morse words t, we compute the "critical exponent", i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.
arxiv