Related papers: On Kronecker's Solvability Theorem
This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…
We study the relationship between the discrete and the continuous versions of the Kronecker--Weyl equidistribution theorem, as well as their possible extension to manifolds in higher dimensions. We also investigate a way to deduce in some…
Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.
Lurie's representability theorem gives necessary and sufficient conditions for a functor to be an almost finitely presented derived geometric stack. We establish several variants of Lurie's theorem, making the hypotheses easier to verify…
Let P_nk(x) denote the sum of the lowest k+1 terms in the expansion of (1+x)^n. We investigate the irreducibility of P_nk(x) and more general univariate polynomials related to it. Polynomials P_nk(x) naturally arise in Schubert calculus,…
Following a recently considered generalisation of linear equations to unordered-data vectors and to ordered-data vectors, we perform a further generalisation to data vectors that are functions from k-element subsets of the unordered-data…
We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…
Tropical differential equations are introduced and an algorithm is designed which tests solvability of a system of tropical linear differential equations within the complexity polynomial in the size of the system and in its coefficients.…
Kronecker regression is a highly-structured least squares problem $\min_{\mathbf{x}} \lVert \mathbf{K}\mathbf{x} - \mathbf{b} \rVert_{2}^2$, where the design matrix $\mathbf{K} = \mathbf{A}^{(1)} \otimes \cdots \otimes \mathbf{A}^{(N)}$ is…
A well-known theorem by Milnor-Orlik provides a formula for the Milnor number of a weighted-homogeneous polynomial having an isolated singularity that depends only on the weights. In this paper we present a proof of that result using…
We propose a systematic method for analyzing Rohrlich-type divisor sums for arbitrary congruence subgroups $\Gamma_0(N)$. Our main theorem unifies various results from the literature, and its significance is illustrated through the…
In a recent talk of Robbert Fokkink, some conjectures related to the infinite Tribonacci word were stated by the speaker and the audience. In this note we show how to prove (or disprove) the claims easily in a "purely mechanical" fashion,…
We reduce the Nowicki conjecture on the Weitzenb\"ock derivation of polynomial algebras to well-known problem of the classical invariant theory.
Exact and quasi-exact solvabilities of the one-dimensional Schr\"odinger equation are discussed from a unified viewpoint based on the prepotential together with Bethe ansatz equations. This is a constructive approach which gives the…
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…
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…
We prove a computable version of Hall's Harem Theorem and apply it to computable versions of Tarski's alternative theorem.
The main theorem here is the K-theoretic analogue of the cohomological `stable double component formula' for quiver functions in [Knutson, Miller, and Shimozono, math.AG/0308142]. This K-theoretic version is still in terms of lacing…
In this note, we aim to prove the finite semi-algebraic chamber decomposition theorem for K-semi(poly)stability under the assumption of the log boundedness of K-semistable degenerations. This boundedness assumption is naturally arising from…
We present Korovkin approximation theorems that incorporate summability methods. These result allows us to obtain a unified treatment of several previous results, focusing on the underlying structure and the properties that a summability…