Related papers: How many delta-matroids are there?
It is well-known that a delta potential well in 1D has only one bound state but that in 3D it supports an {\it infinite} number of bound states with {\it infinite} binding energy for the lowest level. We show how this also holds for the…
We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound…
Tropical geometry gives a bound on the ranks of divisors on curves in terms of the combinatorics of the dual graph of a degeneration. We show that for a family of examples, curves realizing this bound might only exist over certain…
New upper and lower limits are given for the number of S-wave bound states yielded by an attractive (monotonic) potential in the context of the Schrodinger or Klein-Gordon equation.
We use GL(2) delta method to establish the Burgess bound.
Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the Well-quasi-ordering-Conjecture to infinite matroids and to show that…
We give upper and lower bounds for the ground-state energy of the infinite-U Hubbard model. In two dimensions, using these bounds we are able to rule out the possibility of phase separation between the undoped-insulating state and an…
In this paper, we bound the number of edges of a maximal permutation graph with n vertices. We propose a new method to compute the lower bound by splitting the set of labellings of the edges into six parts, considering one separate problem…
We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given $E\subset \mathbb…
An edge colouring of a multigraph can be thought of as a partition of the edges into matchings (a matching meets each vertex at most once). Analogously, an edge cover colouring is a partition of the edges into edge covers (an edge cover…
We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for $\alpha\in\mathbb{R}\backslash\mathbb{Q},\,\beta\in\mathbb{R}$ and $0<\theta<10/1561$, there…
We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic…
In this thesis, we study nearly finitary matroids by introducing new definitions and prove various properties of nearly finitary matroids. In 2010, an axiom system for infinite matroids was proposed by Bruhn et al. We use this axiom system…
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary…
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…
In this article, we obtain an upper bound for the number of integral solutions, of given height, of system of two quadratic forms in five variables. Our bound is an improvement over the bound given by Henryk Iwaniec and Ritabrata Munshi in…
The paper deals with planar polynomial vector fields. We aim to estimate the number of orbital topological equivalence classes for the fields of degree n. An evident obstacle for this is the second part of Hilbert's 16th problem. To…
In the context of mining for frequent patterns using the standard levelwise algorithm, the following question arises: given the current level and the current set of frequent patterns, what is the maximal number of candidate patterns that…
We announce the classification of Sato-Tate groups of abelian threefolds over number fields; there are 410 possible conjugacy classes of closed subgroups of USp(6) that occur. We summarize the key points of the "upper bound" aspect of the…