Results 1 to 10 of about 10,393,784 (287)

The approximation of Laplace-Stieltjes transforms with finite order [PDF]

open access: yesJournal of Inequalities and Applications, 2017
In this paper, we study the irregular growth of an entire function defined by the Laplace-Stieltjes transform of finite order convergent in the whole complex plane and obtain some results about λ-lower type.
Hong Yan Xu, San Yan Liu
doaj   +2 more sources

Second-Order Finite Automata [PDF]

open access: yesTheory of Computing Systems, 2020
AbstractTraditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata with ordered decision diagrams, with the aim of representing possibly infinitesets of setsof strings. Our
Alexsander Andrade de Melo   +1 more
openaire   +7 more sources

On the heapability of finite partial orders [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a minimal decomposition.
Balogh, János   +4 more
openaire   +6 more sources

Growth and oscillation of some polynomials generated by solutions of complex differential equations [PDF]

open access: yesOpuscula Mathematica, 2015
In this paper, we continue the study of some properties on the growth and oscillation of solutions of linear differential equations with entire coefficients of the type \[f^{\prime \prime }+A(z) f^{\prime }+B(z) f=0\] and \[f^{\left( k\right) }+A_{k-2}(z)
Zinelâabidine Latreuch   +1 more
doaj   +1 more source

FINITE ORDER BFFT METHOD [PDF]

open access: yesInternational Journal of Modern Physics A, 2003
We propose a method in the context of BFFT approach that leads to truncation of the infinite series regarded as constraints in the extended phase space, as well as other physical quantities (such as Hamiltonian). This has been done for cases where the matrix of Poisson brackets among the constraints is symplectic or constant.
Monemzadeh, M., Shirzad, A.
openaire   +2 more sources

Hypermap operations of finite order [PDF]

open access: yesDiscrete Mathematics, 2010
14 pages. To appear in Discrete Mathematics (Proc. Bled Combinatorics Conf. 2007)
Gareth A. Jones, Daniel Pinto
openaire   +4 more sources

Fracton topological order at finite temperature

open access: yesPhysical Review Research, 2022
As new kinds of stabilizer code models, fracton models have been promising in realizing quantum memory or quantum hard drives. However, it has been shown that the fracton topological order of 3D fracton models occurs only at zero temperature.
Xiaoyang Shen   +4 more
doaj   +1 more source

Bases in finite groups of small order

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2021
A subset $B$ of a group $G$ is called a basis of $G$ if each element $g\in G$ can be written as $g=ab$ for some elements $a,b\in B$. The smallest cardinality $|B|$ of a basis $B\subseteq G$ is called the basis size of $G$ and is denoted by $r[G]$.
T.O. Banakh, V.M. Gavrylkiv
doaj   +1 more source

Some properties of algebraic difference equations of first order

open access: yesAdvances in Difference Equations, 2017
We prove that if g ( z ) $g(z)$ is a finite-order transcendental meromorphic solution of ( △ c g ( z ) ) 2 = A ( z ) g ( z ) g ( z + c ) + B ( z ) , $$\bigl(\triangle_{c} g(z)\bigr)^{2}=A(z)g(z)g(z+c)+B(z), $$ where A ( z ) $A(z)$ and B ( z ) $B(z)$ are ...
Yong Liu
doaj   +1 more source

The facial weak order in finite Coxeter groups [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
We investigate a poset structure that extends the weak order on a finite Coxeter group W to the set of all faces of the permutahedron of W. We call this order the facial weak order.
Aram Dermenjian   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy