oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Polynomial reconstruction of the matching polynomial  [PDF]
Xueliang Li,Yongtang Shi,Martin Trinks
Mathematics , 2014,
Abstract: The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex-deleted subgraphs of the same graph. This note discusses the polynomial reconstructibility of the matching polynomial. We collect previous results, prove it for graphs with pendant edges and disprove it for some graphs.
Asymptotics of the Upper Matching Conjecture  [PDF]
Liviu Ilinca,Jeff Kahn
Mathematics , 2012,
Abstract: We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular, for $d$-regular, $N$-vertex graphs, our bound is best possible up to an error factor of the form $\exp[o_d(1)N]$, where $o_d(1) \rightarrow 0$ as $d \rightarrow \infty$. This represents the best progress to date on the "Upper Matching Conjecture" of Friedland, Krop, Lundow and Markstr\"om. Some further possibilities are also suggested.
Polynomial Retracts and the Jacobian Conjecture  [PDF]
Vladimir Shpilrain,Jie-Tai Yu
Mathematics , 1997,
Abstract: Let $ K[x, y]$ be the polynomial algebra in two variables over a field $K$ of characteristic $0$. A subalgebra $R$ of $K[x, y]$ is called a retract if there is an idempotent homomorphism (a {\it retraction}, or {\it projection}) $\varphi: K[x, y] \to K[x, y]$ such that $\varphi(K[x, y]) = R$. The presence of other, equivalent, definitions of retracts provides several different methods of studying them, and brings together ideas from combinatorial algebra, homological algebra, and algebraic geometry. In this paper, we characterize all the retracts of $ K[x, y]$ up to an automorphism, and give several applications of this characterization, in particular, to the well-known Jacobian conjecture. Notably, we prove that if a polynomial mapping $\varphi$ of $K[x,y]$ has invertible Jacobian matrix {\it and } fixes a non-constant polynomial, then $\varphi$ is an automorphism.
A Conjecture on random bipartite matching  [PDF]
Giorgio Parisi
Physics , 1998,
Abstract: In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
The Bouniakowsky conjecture and the density of polynomial roots to prime moduli  [PDF]
Timothy Foo
Mathematics , 2009, DOI: 10.4064/aa144-1-1
Abstract: We establish a result linking the Bouniakowsky conjecture and the density of polynomial roots to prime moduli.
Pattern Matching under Polynomial Transformation  [PDF]
Ayelet Butman,Peter Clifford,Raphael Clifford,Markus Jalsenius,Noa Lewenstein,Benny Porat,Ely Porat,Benjamin Sach
Computer Science , 2011,
Abstract: We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse as image processing and musical information processing where application specific transformations are often applied to the input. By considering the class of polynomial transformations of the input, we provide fast algorithms and the first lower bounds for both new and old problems. Given a pattern of length m and a longer text of length n where both are assumed to contain integer values only, we first show O(n log m) time algorithms for pattern matching under linear transformations even when wildcard symbols can occur in the input. We then show how to extend the technique to polynomial transformations of arbitrary degree. Next we consider the problem of finding the minimum Hamming distance under polynomial transformation. We show that, for any epsilon>0, there cannot exist an O(n m^(1-epsilon)) time algorithm for additive and linear transformations conditional on the hardness of the classic 3SUM problem. Finally, we consider a version of the Hamming distance problem under additive transformations with a bound k on the maximum distance that need be reported. We give a deterministic O(nk log k) time solution which we then improve by careful use of randomisation to O(n sqrt(k log k) log n) time for sufficiently small k. Our randomised solution outputs the correct answer at every position with high probability.
Link polynomial calculus and the AENV conjecture  [PDF]
S. Arthamonov,A. Mironov,A. Morozov,An. Morozov
Mathematics , 2013, DOI: 10.1007/JHEP04(2014)156
Abstract: Using the recently proposed differential hierarchy (Z-expansion) technique, we obtain a general expression for the HOMFLY polynomials in two arbitrary symmetric representations of link families, including Whitehead and Borromean links. Among other things, this allows us to check and confirm the recent conjecture of arXiv:1304.5778 that the large representation limit (the same as considered in the knot volume conjecture) of this quantity matches the prediction from mirror symmetry consideration. We also provide, using the evolution method, the HOMFLY polynomial in two arbitrary symmetric representations for an arbitrary member of the one-parametric family of 2-component 3-strand links, which includes the Hopf and Whitehead links.
The Thom Conjecture for proper polynomial mappings  [PDF]
Zbigniew Jelonek
Mathematics , 2014,
Abstract: Let $f,g:X \to Y$ be continuous mappings. We say that $f$ is topologically equivalent to $g$ if there exist homeomorphisms $\Phi : X\to X$ and $\Psi: Y\to Y$ such that $\Psi\circ f\circ \Phi=g.$ Let $X,Y$ be complex smooth irreducible affine varieties. We show that every algebraic family $F: M\times X\ni (m, x)\mapsto F(m, x)=f_m(x)\in Y$ of polynomial mappings contains only a finite number of topologically non-equivalent proper mappings. In particular there are only a finite number of topologically non-equivalent proper polynomial mappings $f: \Bbb C^n\to\Bbb C^m$ of bounded (algebraic) degree. This gives a positive answer to the Thom Conjecture in the case of proper polynomial mappings.
Mahler measure of the colored Jones polynomial and the volume conjecture  [PDF]
Hitoshi Murakami
Mathematics , 2002,
Abstract: In this note, I will discuss a possible relation between the Mahler measure of the colored Jones polynomial and the volume conjecture. In particular, I will study the colored Jones polynomial of the figure-eight knot on the unit circle. I will also propose a method to prove the volume conjecture for satellites of the figure-eight knot.
A polynomial version of Sarnak's conjecture  [PDF]
Tanja Eisner
Mathematics , 2015,
Abstract: Motivated by the variations of Sarnak's conjecture due to El Abdalaoui, Kulaga-Przymus, Lemanczyk, De La Rue and by the observation that the Mobius function is a good weight (with limit zero) for the polynomial pointwise ergodic theorem, we introduce polynomial versions of the Sarnak conjecture for minimal systems.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.