相关论文: An elementary proof of Bridy's theorem

In Sternfeld's work on Kolmogorov's Superposition Theorem appeared the combinatorial-geometric notion of a basic set and a certain kind of arrays. A subset $X \subset \mathbb R^n$ is basic if any continuous function $X\to \mathbb R$ could…

Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…

A stationary random sequence admits under some assumptions a representation as the sum of two others: one of them is a martingale difference sequence, and another is a so-called coboundary. Such a representation can be used for proving some…

It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…

In this paper, we develop a theory of equipped graded graphs (or Bratteli diagrams) and an alternative theory of projective limits of finite-dimensional simplices. An equipment is an additional structure on the graph, namely, a system of…

We explicitly determine the Ap\'ery limits for the sums of powers of binomial coefficients. As an application, we prove a weak version of Franel's conjecture on the order of the recurrences for these sequences. Namely, we prove the…

The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

We prove that the simplicial cocommutative coalgebra of singular chains on a connected topological space determines the homotopy type rationally and one prime at a time, without imposing any restriction on the fundamental group. In…

In 2014, Flynn and the second author bounded the average number of components of the functional graphs of polynomials of fixed degree over a finite field. When the fixed degree was large (relative to the size of the finite field), their…

Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…

When decomposing a finite semigroup into a wreath product of groups and aperiodic semigroups, complexity measures the minimal number of groups that are needed. Determining an algorithm to compute complexity has been an open problem for…

Muchnik's theorem about simple conditional descriptions states that for all strings $a$ and $b$ there exists a short program $p$ transforming $a$ to $b$ that has the least possible length and is simple conditional on $b$. In this paper we…

A theorem proved by Quillen and by Catlin and D'Angelo states that a bi-homogeneous form on a multidimensional complex space which is positive away from zero can be written as a sum of squares of absolute values of polynomials once it is…

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

A graph $A$ is "apex" if $A-z$ is planar for some vertex $z\in V(A)$. Eppstein [Algorithmica, 2000] showed that for a minor-closed class $\mathcal{G}$, the graphs in $\mathcal{G}$ with bounded radius have bounded treewidth if and only if…

Let $A$ be a complex unital Banach algebra. Using a connection between the spectral distance and the growth characteristics of a certain entire map into $A$, we derive a generalization of Gelfand's famous Power Boundedness Theorem.…

For an ideal $I$ in a regular local ring or a graded ideal $I$ in the polynomial ring we study the limiting behavior of the Betti numbers of S/I^k as k goes to infinity. By Kodiyalam's result it is known that in each homological degree the…

A Boolean algebra $\mathcal A$ has the Nikodym property if every pointwise bounded sequence of bounded finitely additive measures on $\mathcal A$ is uniformly bounded. Assuming the Diamond Principle $\Diamond$, we will construct an example…