Zobrazeno 1 - 10
of 25 257
pro vyhledávání: '"[MATH] Mathematics"'
Publikováno v:
Open Communications in Nonlinear Mathematical Physics, Vol Special Issue in Memory of... (2024)
We propose a novel discretization procedure for the classical Euler equation, based on the theory of Galois differential algebras and the finite operator calculus developed by G.C. Rota and collaborators. This procedure allows us to define algorithmi
Externí odkaz:
https://doaj.org/article/d1a61aa9de33444b8ab4eab31efb24e8
Autor:
Fabio Briscese, Francesco Calogero
Publikováno v:
Open Communications in Nonlinear Mathematical Physics, Vol Special Issue in Memory of... (2024)
In this paper we introduce some conjectures analogous to the well-known Collatz conjecture.
Externí odkaz:
https://doaj.org/article/ef2941fd7bef4fc1bdc37621ad162fd9
Autor:
Mehri Javanian, Rafik Aguech
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:2, Iss Combinatorics (2024)
The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node independently attracts a new node with probability p, or fails to do with probability 1 − p. Here, we investigate the number of prote
Externí odkaz:
https://doaj.org/article/423db1134d2b4f38ac4ee307ab9ceb3c
Autor:
Toufik Mansour, Gökhan Yıldırım
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:2, Iss Combinatorics (2023)
We study the enumeration of inversion sequences that avoid the pattern 021 and another pattern of length four. We determine the generating trees for all possible pattern pairs and compute the corresponding generating functions. We introduce the conce
Externí odkaz:
https://doaj.org/article/fe300d5d25124e83955566b88b6e1894
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:2, Iss Discrete Algorithms (2023)
In this paper, we study the problem of gossiping with interference constraint in radio ring networks. Gossiping (or total exchange information) is a protocol where each node in the network has a message and is expected to distribute its own message t
Externí odkaz:
https://doaj.org/article/557d2d74475b4cf781434c44259b38bc
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:1, Iss Graph Theory (2023)
An s-branching flow f in a network N = (D, u), where u is the capacity function, is a flow thatreaches every vertex in V(D) from s while loosing exactly one unit of flow in each vertex other thans. Bang-Jensen and Bessy [TCS, 2014] showed that, when
Externí odkaz:
https://doaj.org/article/a061e59ab6c04f3d9bd882f1d0755459
Autor:
Paul Levrie, John Campbell
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no 2, Iss Analysis of Algorithms (2023)
In 2010, Kh. Hessami Pilehrood and T. Hessami Pilehrood introduced generating function identities used to obtain series accelerations for values of Dirichlet's $\beta$ function, via the Markov--Wilf--Zeilberger method. Inspired by these past results,
Externí odkaz:
https://doaj.org/article/35697eeaf2944b30a564c35f48efb037
Publikováno v:
Journal of Differential Equations. 348:154-190
We find the normal forms of hyperbolic logarithmic transseries with respect to parabolic logarithmic normalizing changes of variables. We provide a necessary and sufficient condition on such transseries for the normal form to be linear. The normalizi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe3093fe6fb1c9aae5573b49adce15ee
https://doi.org/10.1016/j.jde.2022.12.002
https://doi.org/10.1016/j.jde.2022.12.002
Publikováno v:
Queueing Systems. 103:275-312
This paper addresses the ubiquity of remarkable measures on graphs, and their applications. In many queueing systems, it is necessary to take into account the compatibility constraints between users, or between supply and demands, and so on. The stab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b129d0c46388b33cb6b18c2baa87f03
https://doi.org/10.1007/s11134-023-09872-0
https://doi.org/10.1007/s11134-023-09872-0
Publikováno v:
Japan Journal of Industrial and Applied Mathematics. 40:775-807
The aim of this paper is to present an algorithm to solve frictional contact problems by considering the Coulomb's criterion. As it is known, the frictional contact problem using Coulomb's criterion has no minimization principle behind. However in or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8918b42ef342b9ebf3b2c1d2321014d4
https://doi.org/10.1007/s13160-023-00565-y
https://doi.org/10.1007/s13160-023-00565-y