According to Huang (1987), all Chinese existential sentences involve the string of “... (NP) ... V ... NP ... (XP) ...”. When the V position is occupied by the verb you, the XP is refered to as you-coda. It has been observed that although the aspect markers zhe and le may alternate in the locative inversion construction (LIC), the superficially identical V-le and V-zhe sequences cannot appear i...

For a graph invariant π, the Contraction(π) problem consists of, given G and positive integers k,d, deciding whether one can contract k edges of to obtain in which π has dropped by at least d. Galby et al. [ISAAC 2019, MFCS 2019] studied case where is size minimum dominating set. We focus on invariants defined as vertex set that hits all occurrences graphs collection H according fixed containme...

Imbalance is a classical graph layout problem with several applications, particularly in drawing. The imbalance of σ determined by how well-balanced the neighbors vertices are σ. In present work, we study parameterized twin cover graph. We show that XP cover, and FPT when size largest clique outside cover. contrast, introduce notion succinct representations graphs terms their demonstrate NP-har...

We present a short and conceptual proof of Gauss’ quadratic reciprocity law. It is an optimized version of V.A. Lebesgue’s 1838 proof computing the number of solutions to x1 + x 2 2 + · · · + xp ≡ 1 mod q. Let p, q be distinct odd prime numbers. The law of quadratic reciprocity states that ( p q )( q p ) = (−1) p−1 2 q−1 2 , where ( · · ) is the Legendre symbol. In 1838, V.A. Lebesgue gave a pr...

Extensive paramagnetic susceptibility studies between liquid helium and room tem perature have been carried out on polycrystalline samples of the two organometallic Np(IV)-complexes Np(C5 H 5 ) 4 and (CsHs^NpCl. From a combined interpretation of the corresponding l / y m-vs-Tand /4 ff-vs-T-curves, respectively, is suggested tha t, in accordance w ith the tetrahedral molecular sym metry to be as...

We investigate and classify fixed parameter complexity of several infinite duration games, including Rabin, Streett, Muller, parity, mean payoff, and simple stochastic, using different natural parameterizations. Most known fixed parameter intractable games are PSPACEor EXP-complete classically, AW [∗] or XP-hard parametrically, and are all finite duration games. In contrast, the games we consid...

According to Chomsky’s Labeling Algorithm the merger of two phrases, i.e., {XP, YP}, is labeled either via feature sharing between elements or by ignoring lower copies movement chains. It not immediately clear, within this approach, how adjunction structures such as {aP, nP} are be labeled. In those languages where adjectives show concord with nouns in φ features, shared features may provide la...

Abstract An Eulerian walk (or trail) is a (resp. that visits every edge of graph G at least exactly) once. This notion was first discussed by Leonhard Euler while solving the famous Seven Bridges Königsberg problem in 1736. But what if had to take bus? In temporal $$\varvec{(G,\lambda )}$$ ( G...