in this paper we study the zagreb index in bucket recursive trees containing buckets with variable capacities. this model was introduced by kazemi in 2012. weobtain the mean and variance of the zagreb index andintroduce a martingale based on this quantity.

In this paper, we prove that every F ∗ space (i.e., Hausdorff topological vector space satisfying the first countable axiom) can be characterized by means of its “standard generating family of pseudo-norms”. By using the standard generating family of pseudo-norms P, the concepts of P-bounded set and γ-maxpseudo-norm-subadditive operator in F ∗ space are introduced. The uniform boundedness princ...

this paper may be regarded as a new numerical method for the analysis of triangular thin plates using the natural area coordinates. previous studies on the solution of triangular plates with different boundary conditions are mostly based on the rayleigh-ritz principle which is performed in the cartesian coordinates. consequently, manipulation of the geometry and numerical calculation of the int...

Subodh Paudel, Mohamed Elmtiri, Wil L. Kling, Olivier Le Corre, Bruno Lacarrière Department of Energy System and Environment, Ecole des Mines, Nantes, GEPEA, CNRS, UMR 6144, France Environnement Recherche et Innovation, Veolia, France Department of Electrical Engineering, Technische Universiteit Eindhoven, Netherlands *Corresponding author. Tel.: +33 2 51 85 82 57 E-mail: Olivier.Lecorre@mines-...

Erdős and Rényi proposed in 1960 a probabilistic model for sums of s integral sth powers. Their model leads almost surely to a positive density for sums of s pseudo sth powers, which does not reflect the case of sums of two squares. We refine their model by adding arithmetical considerations and show that our model is in accordance with a zero density for sums of two pseudo-squares and a positi...

We introduce pseudo-deterministic interactive proofs (psdAM): interactive proof systems for search problems where the verifier is guaranteed with high probability to output the same output on different executions. As in the case with classical interactive proofs, the verifier is a probabilistic polynomial time algorithm interacting with an untrusted powerful prover. We view pseudo-deterministic...

In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations.