相关论文: Nonexistence of minimal-time solutions for some va…
We consider the firing squad synchronization problems for paths in the two and the three-dimensional grid spaces. Minimal-time solutions of these problems are not known and are unlikely to exist. However, at present we have no proofs of…
The firing squad synchronization problem (FSSP, for short) is a problem in automata theory introduced in 1957 by John Myhill. Its goal is to design a finite automaton A such that, if copies of A are placed in a line and connected and are…
We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively, where e_c is…
The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but…
We present different classes of solutions to the Firing Squad Synchronization Problem on networks of different shapes. The nodes are finite state processors that work at unison discrete steps. The networks considered are the line, the ring…
Consider a fully-connected synchronous distributed system consisting of $n$ nodes, where up to $f$ nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous $C$-counting problem, all nodes need to…
In this paper we seek static spherically symmetric solutions of Horava-Lifshitz-like gravity with projectability condition. We consider the most general form of gravity action without detailed balance, and require the spacetime metric to…
The static, spherical solutions that exhibit an antisymmetry between the temporal and radial coordinates in $f(R)$ gravity theories are presented. I present the constraint for this antisymmetry and show that pure $R^2$ models produce these…
In this paper, we study a class of approximation problems, appearing in data approximation and signal processing. The approximations are constructed as combinations of polynomial splines (piecewise polynomials), whose parameters are subject…
We reconsider here the problem of finding the general 4D spherically symmetric, asymptotically flat and time-independent solutions to the lowest-order string equations in the $\ap$ expansion. Our construction includes earlier work, but…
We investigate all static spherically symmetric solutions in the context of general relativity surrounded by a minimally-coupled quintessence field, using dynamical system analysis. Applying the 1+1+2 formalism and introducing suitable…
In this paper, we apply the variational method with the Structural Prescribed Boundary Conditions (SPBC) to prove the existence of periodic and quasi-periodic solutions for planar four-body problem with $m_1=m_3$ and $m_2=m_4$. A path…
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…
The question of global existence or non-existence of solution to a given stochastic partial differential equation under some non-linear conditions always comes to mind. To show that our weak-predictable random field solutions do not have…
We derive spherically symmetric solutions of the classical \lambda-R model, a minimal, anisotropic modification of general relativity with a preferred foliation and two local degrees of freedom. Starting from a 3 + 1 decomposition of the…
This paper investigates the existence of localised axisymmetric (radial) patterns on the surface of a ferrofluid in the presence of a uniform vertical magnetic field. We formally investigate all possible small-amplitude solutions which…
Static spherically symmetric solutions for conformal gravity in three dimensions are found. Black holes and wormholes are included within this class. Asymptotically the black holes are spacetimes of arbitrary constant curvature, and they…
In this paper, we present proofs of the coerciveness of first-order system least-squares methods for general (possibly indefinite) second-order linear elliptic PDEs under a minimal uniqueness assumption. For general linear second-order…
The n-way number partitioning problem, a fundamental challenge in combinatorial optimization, has significant implications for applications such as fair division and machine scheduling. Despite these problems being NP-hard, many…
The design of minimum-compliance bending-resistant structures with continuous cross-section parameters is a challenging task because of its inherent non-convexity. Our contribution develops a strategy that facilitates computing all…