相关论文: Outermost boundaries for star-connected components…

Transition out of a topological phase is typically characterized by discontinuous changes in topological invariants along with bulk gap closings. However, as a clean system is geometrically punctured, it is natural to ask the fate of an…

The boxicity (respectively cubicity) of a graph $G$ is the minimum non-negative integer $k$, such that $G$ can be represented as an intersection graph of axis-parallel $k$-dimensional boxes (respectively $k$-dimensional unit cubes) and is…

We used the NRAO Very Large Array to search for 3.6 cm continuum emission from embedded protostars in a sample of 8 nearby ``starless'' cores that show spectroscopic evidence for infalling motions in molecular emission lines. We detect a…

In this paper, we study some properties of the closure operator in the Mac\'ias topology on infinite integral domains. Moreover, under certain conditions, we present topological proofs of the infiniteness of maximal ideals and…

In this paper, we study connected components of strata of the space of quadratic differentials lying over $\T_g$. We use certain general properties of sections of line bundles to put a upper bound on the number of connected components, and…

We study the topological phase transitions induced in spin-orbit coupled materials with buckling like silicene, germanene, stanene, etc, by circularly polarised light, beyond the high frequency regime, and unearth many new topological…

In this paper, we introduce the graph $G(S)$ of a bounded semilattice $S$, which is a generalization of the intersection graph of the substructures of an algebraic structure. We prove some general theorems about these graphs; as an example,…

We consider the hexagonal circle packing with radius 1/2 and perturb it by letting the circles move as independent Brownian motions for time t. It is shown that, for large enough t, if \Pi_t is the point process given by the center of the…

In 2010, the STAR Collaboration collected 38 million low-multiplicity triggers for ultra-peripheral collision studies. We present new results involving photonuclear interactions in ultra-peripheral relativistic heavy ion collisions (UPCs),…

The relation between ices in the envelopes and disks surrounding YSOs and those in the quiescent interstellar medium is investigated. For a sample of 31 stars behind isolated dense cores, ground-based and Spitzer spectra and photometry in…

Bae and Park found an upper bound on the arc index of prime links in terms of the minimal crossing number. In this paper, we extend the definition of the arc presentation to spatial graphs and find an upper bound on the arc index $\alpha…

Context. IRAS 16293E is a rare case of a prestellar core being subjected to the effects of at least one outflow.Aims. We want to disentangle the actual structure of the core from the outflow impact and evaluate the evolutionary stage of the…

We prove that, after centering and diffusively rescaling space and time, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2_{even}:={(x,i) in Z^2: x+i is even}…

A set S is independent in a graph G if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, while mu(G) is the size of a maximum matching in G. If alpha(G)+mu(G)=|V|, then…

The star chromatic index $\chi_s'(G)$ of a graph $G$ is the minimum number of colors needed to properly color the edges of the graph so that no path or cycle of length four is bi-colored. We obtain a near-linear upper bound in terms of the…

We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. The smallest size of an identifying code of $G$ is denoted $\gamma^{\text{ID}}(G)$.…

By studying its subgraphs, it is argued that the lower critical percolation threshold of the enhanced binary tree (EBT) is bounded as $p_{c1} < 0.355059$, while the upper threshold is bounded both from above and below by 1/2 according to…

We study a model of coupled oscillators with bidirectional first nearest neighbours coupling with periodic boundary conditions. We show that a stable phase-locked solution is decided by the oscillators at the borders between the major…

We consider the following singularly perturbed Neumann problem \begin{eqnarray*} \ve^2 \Delta u -u +u^p = 0 \, \quad u>0 \quad {\mbox {in}} \quad \Omega, \quad {\partial u \over \partial \nu}=0 \quad {\mbox {on}} \quad \partial \Omega,…