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

Given a family of groups admitting a braided monoidal structure (satisfying mild assumptions) we construct a family of spaces on which the groups act and whose connectivity yields, via a classical argument of Quillen, homological stability…

The numerical invariants (global) cohomological length, (global) cohomological width, and (global) cohomological range of complexes (algebras) are introduced. Cohomological range leads to the concepts of derived bounded algebras and…

We prove that Sherali-Adams with polynomially bounded coefficients requires proofs of size $n^{\Omega(d)}$ to rule out the existence of an $n^{\Theta(1)}$-clique in Erd\H{o}s-R\'{e}nyi random graphs whose maximum clique is of size $d\leq…

Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say…

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…

Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley…

Let $f$ and $g$ be Weierstrass polynomials with coefficients in the ring of formal power series over an algebraically closed field of characteristic zero. Assume that $f$ is irreducible and quasi-ordinary. We show that if degree of $g$ is…

A set of algebraic numbers has the Northcott property if each of its subsets of bounded Weil height is finite. Northcott's Theorem, which has many Diophantine applications, states that sets of bounded degree have the Northcott property.…

We construct an explicit filtration of the ring of algebraic power series by finite dimensional constructible sets, measuring the complexity of these series. As an application, we give a bound on the dimension of the set of algebraic power…

The aim of this note is to show the existence of a correspondance between certain algebraic continued fractions in fields of power series over a finite field and automatic sequences in the same finite field. this connection is illustrated…

Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…

The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…

We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given k-automatic sequence is ultimately…

In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…

We prove affirmatively the one dimensional case of a conjecture of Stein regarding the $L^p$-boundedness of the Polynomial Carleson operator, for $1<p<\infty$. The proof is based on two new ideas: i) developing a framework for…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with…

A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…