相关论文: Two particles on a star graph I
The classical model of spinning particle is analyzed in details in two versions - with single spinor and two spinors put on the trajectory. Equations of motion of the first version are easily solvable. The system with two spinors becomes…
We propose an approach to quantize discrete networks (graphs with discrete edges). We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and…
We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.
We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…
We define an analytic version of the graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the random graph obtained when using the…
We consider systems of Brownian particles in the space of positive definite matrices, which evolve independently apart from some simple interactions. We give examples of such processes which have an integrable structure. These are related…
When a particle decays into two fragments, the wavefunctions of the latter are spherical shells with expanding radii. In spite of this spherical symmetry, the two particles can be detected only in opposite directions.
A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence $(k_1+ 1, k_2+ 1, 1, \ldots, 1)$ is denoted by $S_{k_1, k_2}$. We study the edge-decomposition of regular graphs into…
Test particles interact with a medium by means of a bimolecular reversible chemical reaction. Two species are assumed to be much more numerous so that they are distributed according fixed distributions: Maxwellians and Dirac's deltas.…
A simplicial complex $\Delta$ is called flag if all minimal nonfaces of $\Delta$ have at most two elements. The following are proved: First, if $\Delta$ is a flag simplicial pseudomanifold of dimension $d-1$, then the graph of $\Delta$ (i)…
Let $G$ and $H$ be acyclic, upward bipolarly oriented plane graphs with the same number $n$ of edges. While $G$ can symbolize a flow network, $H$ has only a controlling role. Let $\phi$ and $\psi$ be bijections from $\{1, \dots, n\}$ to the…
In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which…
We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…
We reduce two-body problem to the one-body problem in general case of deformed Heisenberg algebra leading to minimal length.Two-body problems with delta and Coulomb-like interactions are solved exactly. We obtain analytical expression for…
The observation is presented of naturally occurring pairing of particles and their cooperative drift in a two-dimensional plasma crystal. A single layer of plastic microspheres was suspended in the plasma sheath of a capacitively coupled rf…
We reconsider a model of two relativistic particles interacting via a multiplicative potential, as an example of a simple dynamical system with sectors, or branches, with different dynamics and degrees of freedom.The presence or absence of…
Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…
Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…
To each graph on $n$ vertices there is an associated subspace of the $n \times n$ matrices called the operator system of the graph. We prove that two graphs are isomorphic if and only if their corresponding operator systems are unitally…