Related papers: Constructive characterization of the reduction num…

The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among…

This work focuses on the problem of exact model reduction of positive linear systems, by leveraging minimal realization theory. While determining the existence of a positive reachable realization remains in general an open problem, we are…

We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices.…

We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…

We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.

We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gr\"obner basis. In this case, the ideal is radical, and we can describe algebraic and numerical…

It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…

Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…

This note describes a representation of the real numbers due to Schanuel. The representation lets us construct the real numbers from first principles. Like the well-known construction of the real numbers using Dedekind cuts, the idea is…

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…

Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…

In this article we study minimal free resolutions of Gorenstein ideals of codimension four, using methods coming from representation theory. We introduce families of higher structure maps associated with such resolution, defined similarly…

Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…

We consider a coset construction of minimal models. We define it rigorously and prove that it gives superconformal minimal models. This construction allows to build all primary fields of superconformal models and to calculate their…

In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…

In this paper, we provide a complete description of the minimal primes of ideals generated by adjacent $2$-minors, in terms of the so-called admissible sets and associated lattice ideals. We prove that for these ideals, the properties of…

In this article, we study binomial ideals generated by an arbitrary collection of corner-interval $2$-minors of a generic matrix. We determine the minimal prime ideals of such ideals and characterize their radicality in the special case of…

*Concept-based explanations* offer a promising approach for explaining the predictions of deep neural networks in terms of high-level, human-understandable concepts. However, existing methods either do not establish a causal connection…

We study linear pencils of curves on normal surface singularities. Using the minimal good resolution of the pencil, we describe the topological type of generic elements of the pencil and characterize the behaviour of special elements. Then…