Results 41 to 50 of about 9,546 (165)

On retracts, absolute retracts, and folds in cographs [PDF]

, 2013
Let G and H be two cographs. We show that the problem to determine whether H is a retract of G is NP-complete. We show that this problem is fixed-parameter tractable when parameterized by the size of H. When restricted to the class of threshold graphs or
A. Máté, B. Courcelle, D. Corneil, E. Howorka, E. Pesch, E. Wolk, F. Fomin, F. Harary, H. Bandelt, H. Bandelt, H. Bodlaender, J. Edmonds, M. Golumbic, M. Golumbic, P. Damaschke, P. Golovach, T. Feder   +16 more
core   +1 more source

Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic

Communications on Pure and Applied Mathematics, EarlyView.
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley   +1 more source

Connection Matrices and the Definability of Graph Parameters [PDF]

, 2014
In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A. Makowsky (2009).
Kotek, Tomer, Makowsky, Johann A.
core   +1 more source

The Benjamin–Ono Equation in the Zero‐Dispersion Limit for Rational Initial Data: Generation of Dispersive Shock Waves

Communications on Pure and Applied Mathematics, EarlyView.
ABSTRACT The leading‐order asymptotic behavior of the solution of the Cauchy initial‐value problem for the Benjamin–Ono equation in L2(R)$L^2(\mathbb {R})$ is obtained explicitly for generic rational initial data u0$u_0$. An explicit asymptotic wave profile uZD(t,x;ε)$u^\mathrm{ZD}(t,x;\epsilon)$ is given, in terms of the branches of the multivalued ...
Elliot Blackstone, Louise Gassot, Patrick Gérard, Peter D. Miller   +3 more
wiley   +1 more source

Intersection Numbers of the Natural Embedding of the Twisted Triality Hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$

Journal of Combinatorial Designs, EarlyView.
ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$. We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$ with T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$.
Sebastian Petit, Geertrui Van de Voorde
wiley   +1 more source

Pelabelan Harmonis Ganjil pada Kelas Graf Baru Hasil Operasi Cartesian Product [PDF]

, 2017
Graph class which has the characteristic of odd harmonious labeling is called as odd harmonious graph. Net graph is a graph which is gained by using operation Cartesian product of two line graphs.
Fery Firmansah, Muhammad Ridlo Yuwono
core   +2 more sources

On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley   +1 more source

On a general formalism of nonlinear charge coherent states, their quantum statistics and nonclassical properties

, 2010
In this paper, we will present a general formalism for constructing the nonlinear charge coherent states which in special case lead to the standard charge coher- ent states.
Eftekhari, F., Tavassoly, M. K.
core   +1 more source

Sensitivity and Hamming Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT For any m ≥ 3 $m\ge 3$ we show that the Hamming graph H ( n , m ) $H(n,m)$ admits an imbalanced partition into m $m$ sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m $m$‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio, Yuval Filmus, Ignacio García‐Marco, Kolja Knauer   +3 more
wiley   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source