Related papers: A refined Gallai-Edmonds structure theorem for wei…
In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in $\R^3$. We reduce these theorems to certain property of graphs mapped to the plane.
We give a probalistic proof of the famous Meinardus' asymptotic formula for the number of weighted partitions with weakened one of the three Meinardus' conditions, and extend the resulting version of the theorem to other two classis types…
A short proof is given for the well-known Choi-Effros theorem on the structure of ranges of completely positive projections.
On even-dimensional Euclidean space for integer powers of the Laplace operator greater than or equal to half the dimension, a fundamental solution of the polyharmonic equation has binomial and logarithmic behavior. Gegenbauer polynomial…
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
In this notice, we revisit the recent work [1] of Jung Yoog Kang and Tai Sup about special polynomials with exponential distribution in order to state some improvements and get new proofs for results therein.
Let $f$ and $F$ be two polynomials satisfying $F(x)=u(x)f(x)+v(x)f'(x)$. We characterize the relation between the location and multiplicity of the real zeros of $f$ and $F$, which generalizes and unifies many known results, including the…
We consider a weighted counting problem on matchings, denoted $\textrm{PrMatching}(\mathcal{G})$, on an arbitrary fixed graph family $\mathcal{G}$. The input consists of a graph $G\in \mathcal{G}$ and of rational probabilities of existence…
We study the projective geometry of algebraic neural layers, namely families of maps induced by a polynomial activation function, with particular emphasis on the generic Euclidean Distance degree ($\mathrm{gED}$). This invariant is…
This paper was motivated by a conjecture of Br\"{a}nd\'{e}n (European J. Combin. \textbf{29} (2008), no.~2, 514--531) about the divisibility of the coefficients in an expansion of generalized Eulerian polynomials, which implies the…
The polynomial version of van der Waerden's theorem, proved using dynamical systems by V. Bergelson and A. Leibman in 1996, \cite{Bergelson1996}, significantly highlighted the role of dynamical systems in addressing problems related to…
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…
We describe an effective method for calculating certain infinite sums, generalizations of the classical Bernoulli polynomials. As shown by Edward Witten in his papers on two-dimensional gauge theories, the correlation functions of…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…
Quantization of two-dimensional Yang-Mills theory on a torus in the gauge where the field strength is diagonal leads to twisted sectors that are completely analogous to the ones that originate long string states in Matrix String Theory. If…
In this paper, we prove a structure theorem for the infinite union of $n$-adic doubling measures via techniques which involve far numbers. Our approach extends the results of Wu in 1998, and as a by product, we also prove a classification…
We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…
In this paper, we mainly study the stability of iterated polynomials and linear transformations preserving the strong $q$-log-convexity of polynomials Let $[T_{n,k}]_{n,k\geq0}$ be an array of nonnegative numbers. We give some criteria for…
This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper…
Gallagher's theorem is a sharpening and extension of the Littlewood conjecture that holds for almost all tuples of real numbers. We provide a fibre refinement, solving a problem posed by Beresnevich, Haynes and Velani in 2015. Hitherto,…