相关论文: Short lists with short programs in short time - a …

In this paper, we show that for each lattice basis, there exists an equivalent basis which we describe as ``strongly reduced''. We show that bases reduced in this manner exhibit rather ``short'' basis vectors, that is, the length of the…

We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.

So far, there is no polynomial-time list decoding algorithm (beyond half the minimum distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of Reed--Solomon codes. In this paper, we provide bounds on the list…

A graph has {\em path-width} at most $w$ if it can be built from a sequence of graphs each with at most $w+1$ vertices, by overlapping consecutive terms. Every graph with path-width at least $w-1$ contains every $w$-vertex forest as a…

Here we deal with the logic of [GuSh 533], which tries to capture polynomial time (for finite models). There it is proved that the logic cannot say much on models with equality only. Here we prove that it cannot say much on models for which…

It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

For the first time we provide a succinct pattern matching index for arbitrary graphs that can be built in polynomial time, which requires less space and answers queries more efficiently than the one in [SODA 2021]. We show that, given an…

In this paper, we consider minimal linear codes in a general construction of linear codes from q-ary functions. First, we give the sufficient and necessary condition for codewords to be minimal. Second, as an application, we present four…

We study the problem of minimizing a multivariate polynomial function over the unit hypercube. By representing the polynomial through a hypergraph and exploiting its sparsity structure, we establish a new sufficient condition under which…

We give a short proof, using generating functions, for a polynomial congruence for Eulerian polynomials first proved, using arrangements of hyperplanes, by Yoshinaga and later proved, using roots of unity, by Iijima, Sasaki, Takahashi, and…

Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small…

A short, fairly self-contained proof is given of the Poincar\'e Conjecture. In the previous version there was an error on Page 8. This gap has now been filled.

We prove that there exist bipartite, biregular Ramanujan graphs of every degree and every number of vertices provided that the cardinalities of the two sets of the bipartition divide each other. This generalizes a result of Marcus,…

There are many techniques and tools to prove termination of C programs, but up to now these tools were not very powerful for fully automated termination proofs of programs whose termination depends on recursive data structures like lists.…

We give an elementary proof of a generalization of Bourgain and Tzafriri's Restricted Invertibility Theorem, which says roughly that any matrix with columns of unit length and bounded operator norm has a large coordinate subspace on which…

We give a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our…

A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find the set of lengths of polynomials of the form x^n in R[x], where (R, m) is an Artinian local ring with m^2 = 0.

We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.

If no optimal propositional proof system exists, we (and independently Pudl\'ak) prove that ruling out length $t$ proofs of any unprovable sentence is hard. This mapping from unprovable to hard-to-prove sentences powerfully translates facts…