Related papers: The first Mayr-Meyer ideal
Hilbert's first problem is of importance in relation to work being done in computational systems. It is the question of equipollence of natural and real numbers. By construction equipollence is established for real numbers in open interval…
We demonstrate that the principle of maximum relative entropy (ME), used judiciously, can ease the specification of priors in model selection problems. The resulting effect is that models that make sharp predictions are disfavoured,…
The paper presents complexity results and performance guaranties for a family of approximation algorithms for an optimisation problem arising in software testing and manufacturing. The problem is formulated as a partitioning of a set where…
Motivated by the Mathieu conjecture [Ma], the image conjecture [Z3] and the well-known Jacobian conjecture [K] (see also [BCW] and [E]), the notion of Mathieu subspaces as a natural generalization of the notion of ideals has been introduced…
We compute the linear strand of the minimal free resolution of the ideal generated by k x k sub-permanents of an n x n generic matrix and of the ideal generated by square-free monomials of degree k. The latter calculation gives the full…
In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case. Our main theorem recovers and…
This paper takes a new look at ideals generated by 2x2 minors of 2x3 matrices whose entries are powers of three elements not necessarily forming a regular sequence. A special case of this are the ideals determining monomial curves in three…
Let M be a polynomially bounded, o-minimal structure with archimedean prime model, for example if M is a real closed field. Let C be a convex and unbounded subset of M. We determine the first order theory of the structure M expanded by the…
D. Rees and J. Sally defined the core of an $R$-ideal $I$ as the intersection of all $($minimal$)$ reductions of $I$. However, it is not easy to give an explicit characterization of it in terms of data attached to the ideal. Until recently,…
Finding a proper solution concept for the multi-dimensional barotropic compressible Euler equations and related systems is still an unsolved problem. As revealed by convex integration, the classical notion of an admissible weak solutions…
We consider the general problem of blocking all solutions of some given combinatorial problem with only few elements. For example, the problem of destroying all maximum cliques of a given graph by forbidding only few vertices. Problems of…
In our recent work, we introduced a generalization of the prime ideal factorization in Dedekind domains for submodules of finitely generated modules over Noetherian rings. In this article, we find conditions for the intersection of two…
In this article, we study the primary decomposition of some binomial ideals. In particular, we introduce the concept of polyocollection, a combinatorial object that generalizes the definitions of collection of cells and polyomino, that can…
Derived from the concentration-compactness principle, the concept of generalized minimizer can be used to define generalized solutions of variational problems which may have components ``infinitely'' distant from each other. In this article…
This is a survey of some problems in geometric group theory which I find interesting. The problems are from different areas of group theory. Each section is devoted to problems in one area. It contains an introduction where I give some…
The Fermat-Steiner problem consists in finding all points in a metric space $Y$ such that the sum of distances from each of them to the points from some fixed finite subset of $Y$ is minimal. This problem is investigated for the metric…
There could be thousands of Introductions/Surveys of representation theory, given that it is an enormous field. This is just one of them, quite personal and informal. It has an increasing level of difficulty; the first part is intended for…
Many classical ring-theoretic results state that an ideal that is maximal with respect to satisfying a special property must be prime. We present a "Prime Ideal Principle" that gives a uniform method of proving such facts, generalizing the…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
We keep the definition of intra-regularity (left regularity) of $po$-$\Gamma$-semigroups introduced in arXiv: 1511.00679 which is absolutely necessary for the investigation. Being able to describe the form of the elements of the principal…