相关论文: Christoffel-Darboux type identities for independen…

The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…

The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We…

We prove that the genus polynomials of the graphs called iterated claws are real-rooted. This continues our work directed toward the 25-year-old conjecture that the genus distribution of every graph is log-concave. We have previously…

We survey results and conjectures concerning the zero distribution of chromatic and flow polynomials of graphs, and characteristic polynomials of matroids.

In this paper, we derive a necessary condition for a best approximation by piecewise polynomial functions. We apply nonsmooth nonconvex analysis to obtain this result, which is also a necessary and sufficient condition for inf-stationarity…

We seek to create tools for a model-theoretic analysis of types in algebraically closed valued fields (ACVF). We give evidence to show that a notion of 'domination by stable part' plays a key role. In Part A, we develop a general theory of…

In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

Let $\Omega_p$ be the group of $p$-adic numbers, $ \xi_1$ and $\xi_2$ be independent random variables with values in $\Omega_p$ and distributions $\mu_1$ and $\mu_2$. Let $\alpha_j, \beta_j$ be topological automorphisms of $\Omega_p$.…

Let $X$ be an Abelian group of the form $X=\mathbb{R}^m\times K\times D$, where $m\geq 0$, $K$ is a compact totally disconnected group of the special form, $D$ is a discrete group. Let $\xi_i, i=1,2,...,n,n\geq 2,$ be independent random…

Let $\Omega_p$ be the group of $p$-adic numbers, $ \xi_1$, $\xi_2$, $\xi_3$ be independent random variables with values in $\Omega_p$ and distributions $\mu_1$, $\mu_2$, $\mu_3$. Let $\alpha_j, \beta_j, \gamma_j$ be topological…

In this paper we develop a general method to prove independence of algebraic monodromy groups in compatible systems of representations, and we apply it to deduce independence results for compatible systems both in automorphic and in…

A graph is called claw-free if it contains no induced subgraph isomorphic to the complete bipartite graph $K_{1, 3}$. The undirected power graph of a group $G$ has vertices the elements of $G$, with an edge between $g_1$ and $g_2$ if one of…

For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…

The Darboux transformations of Krawtchouk polynomials are investigated and all possible exceptional Krawtchouk polynomials obtainable from a single-step Darboux transformation are considered. The properties of these exceptional Krawtchouk…

This paper verifies a result of {Shenoy:94} concerning graphoidal structure of Shenoy's notion of independence for Dempster-Shafer theory of belief functions. Shenoy proved that his notion of independence has graphoidal properties for…

We describe a new subclass of the class of real polynomials with real simple roots called self-interlacing polynomials. This subclass is isomorphic to the class of real Hurwitz stable polynomials (all roots in the open left half-plane). In…

To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…

We establish a central limit theorem for the sum of $\epsilon$-independent random variables, extending both the classical and free probability setting. Central to our approach is the use of graphon limits to characterize the limiting…

In this paper we present a theorem concerning an equivalent statement of the Jacobian Conjecture in terms of Picard-Vessiot extensions. Our theorem completes the earlier work of T. Crespo and Z. Hajto which suggested an effective criterion…