We investigate the ground state of a free massless (pseudo)scalar field in 1+1– dimensional space–time. We argue that in the quantum field theory of a free massless (pseudo)scalar field without infrared divergences (Eur. Phys. J. C 24, 653 (2002)) the ground state can be represented by a tensor product of wave functions of the fiducial vacuum and of the collective zero–mode, describing the moti...

We generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from multi-dimensional mean-payoff to energy games, and achieve an algorithm for solving the latter whose running time is exponential only in the dimension, but not in the number of vertices of the game graph. This answers an open question whether energy games with arbitrary initial credit can be solved in pseudo-po...

We consider nmobile agents of limited energy that are placed on a straight line and that need to collectively deliver a single piece of data from a given source point s to a given target point t on the line. Agents can move only as far as their batteries allow. They can hand over the data when they meet. In this paper we show that deciding whether the agents can deliver the data is (weakly) NP-...

We exhibit links between pseudo-Boolean optimization, graph theory and logic. We show the equivalence of maximizing a pseudo-Boolean function and finding a maximum weight stable set; symmetrically minimizing a pseudo-Boolean function is shown to be equivalent to solving a weighted satisfiability problem.

the aim of this paper is to generalize the‎‎notion of pseudo-almost valuation domains to arbitrary‎ ‎commutative rings‎. ‎it is shown that the classes of chained rings‎ ‎and pseudo-valuation rings are properly contained in the class of‎ ‎pseudo-almost valuation rings; also the class of pseudo-almost‎ ‎valuation rings is properly contained in the class of quasi-local‎ ‎rings with linearly ordere...

in this short article, we observe that the path of particle of mass $m$ moving along $mathbf{r}= mathbf{r}(t)$ under pseudo-force $mathbf{a}(t)$, $t$ denotes the time, is given by $mathbf{r}_d= int(frac{dmathbf{r}}{dt} mathbf{a}(t)) dt +mathbf{c}$. we also observe that the effective force $mathbf{f}_e$ on that particle due to pseudo-force $mathbf{a}(t)$, is given by $ mathbf{f}_e= mathbf{f} mat...

the present study was carried out to investigate the potential of single-walled carbon nanotube (swcnts) and carboxylate group functionalized single-walled carbon nanotube (swcnt-cooh) as alternative adsorbents for the removal of basic red 46 (br 46) from contaminated water by using batch adsorption studies. effects of some key operating parameters such as ph, ionic strength and contact time on...

in this research, graphene oxide- gold nanoparticles (aunp/go) were easily fabricated by a redox reaction between go and chloroauric acid without using any additional reductant and then used to stabilize pickering emulsions. (aunp/go) was investigated by ft-ir spectroscopy. the changes of parameters such as contact time, ph, amoxicillin initial concentration and temperature were tested and inve...

We present a pseudo-random bit generator expanding a uniformly random bitstring r of length k/2, where k is the security parameter, into a pseudo-random bit-string of length 2k − log(k) using one modular exponentiation. In contrast to all previous high expansion-rate pseudo-random bit generators, no hashing is necessary. The security of the generator is proved relative to Paillier’s composite d...

Abstmct Minimum variance problem may arise when we want to allocate a given amount of resource as fairly as possible to a finite set of activities under certain constraints. More formally, it is described as follows. Given a finite set E, a subset S of RE, and a function he(x(e)) from a certain domain to R for each e E E (which represents the profit resulting from ailocating x(e) amount of reso...