in this paper, we use petrov-galerkin elements such as continuous and discontinuous lagrange-type k-0 elements and hermite-type 3-1 elements to find an approximate solution for linear fredholm integro-differential equations on $[0,1]$. also we show the efficiency of this method by some numerical examples

‎the frobenius complement of a given frobenius group acts on its kernel‎. ‎the scheme which is arisen from the orbitals of this action is called ferrero pair scheme‎. ‎in this paper‎, ‎we show that the fibers of a ferrero pair scheme consist of exactly one singleton fiber and every two fibers with more than one point have the same cardinality‎. ‎moreover‎, ‎it is shown that the restriction of a...

in this paper, we associate canonically a precyclic mod- ule to a regular multiplier hopf algebra endowed with a group-like projection and a modular pair in involution satisfying certain con- dition

In this paper, we associate canonically a precyclic mod- ule to a regular multiplier Hopf algebra endowed with a group-like projection and a modular pair in involution satisfying certain con- dition

This paper investigates critical configurations for projective reconstruction from multiple images taken by a camera moving in a straight line. Projective reconstruction refers to a determination of the 3D geometrical configuration of a set of 3D points and cameras, given only correspondences between points in the images. A configuration of points and cameras is critical if it can not be determ...

Let V be a finite non-void set ; V lary. Every finite sequence of elements in ia called a vocnbuV is said to be a s t r i n g o n V. G i v e n a s t r i n g x = a l a 2 . . . a n , t h e n u m b e r n i s c a l l e d t h e l e n g t h o f x . The s t r i n g o f l e n g t h z e r o i s c a l l e d t h e n t r i n g a n d i s d e n o t e d b y r~J . Any s e t o f s t r i n g s o n V i s c a l l ...

The celebrated Regularity Lemma of Szemerédi asserts that every sufficiently large graph G can be partitioned in such a way that most pairs of the partition sets span -regular subgraphs. In applications, however, the graph G has to be dense and the partition sets are typically very small. If only one -regular pair is needed, a much bigger one can be found, even if the original graph is sparse. ...

In complex adaptive systems, the topological properties of the interaction network are strong governing influences on the rate of flow of information throughout the system. For example, in epidemiological models, the structure of the underlying contact network has a pronounced impact on the rate of spread of infectious disease throughout a population. Similarly, in evolutionary systems, the top...

The central concept in Szemerédi’s powerful regularity lemma is the so-called ε-regular pair. A useful statement of Alon et al. essentially equates the notion of an ε-regular pair with degree uniformity of vertices and pairs of vertices. The known proof of this characterization uses a clever matrix argument. This paper gives a simple proof of the characterization without appealing to the matrix...