相关论文: Some Brouwerian Counterexamples Regarding Nominal …

Motivated by the search for methods to establish strong minimality of certain low order algebraic differential equations, a measure of how far a finite rank stationary type is from being minimal is introduced and studied: The {\em degree of…

We consider measures supported on sets of irrational numbers possessing many consecutive partial quotients satisfying a condition based on the previous partial quotients. We show that under mild assumptions, such sets will always support…

A subset $C$ of an abelian group $G$ is a minimal additive complement to $W \subseteq G$ if $C + W = G$ and if $C' + W \neq G$ for any proper subset $C' \subset C$. In this paper, we study which sets of integers arise as minimal additive…

In contrast with the notion of complexity, a set $A$ is called anti-complex if the Kolmogorov complexity of the initial segments of $A$ chosen by a recursive function is always bounded by the identity function. We show that, as for…

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

For a subexponential density, so far, there has been no positive conclusion or counter example to show whether it is almost decreasing. In this paper, a subexponential density supported on $\mathbb{R}^+\cup\{0\}$ without the almost decrease…

We study elementary theories of well-pointed toposes and pretoposes, regarded as category-theoretic or "structural" set theories in the spirit of Lawvere's "Elementary Theory of the Category of Sets". We consider weak intuitionistic and…

We study the rotational behaviour on minimal sets of torus homeomorphisms and show that the associated rotation sets can be any type of line segments as well as non-convex and even plane-separating continua. This shows that restrictions…

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

This article discusses nonconforming finite element methods for convex minimization problems and systematically derives dual mixed formulations. Duality relations lead to simple error estimates that avoid an explicit treatment of…

We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…

In this article we prove a non-vanishing statement, as well as several properties of metrics with minimal singularities of adjoint bundles. Our arguments involve many ideas from Y.-T. Siu's analytic proof of the finite generation of the…

The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…

I shall argue that the commonly held V not equal L via maximize position, which rejects the axiom of constructibility V = L on the basis that it is restrictive, implicitly takes a stand in the pluralist debate in the philosophy of set…

Detecting hidden convexity is one of the tools to address nonconvex minimization problems. After giving a formal definition of hidden convexity, we introduce the notion of conditional infimum, as it will prove instrumental in detecting…

Structural models that admit multiple reduced forms, such as game-theoretic models with multiple equilibria, pose challenges in practice, especially when parameters are set-identified and the identified set is large. In such cases,…

This doctoral thesis is devoted to the analysis of some minimization problems that involve nonlocal functionals. We are mainly concerned with the $s$-fractional perimeter and its minimizers, the $s$-minimal sets. We investigate the behavior…

Nominal algebra includes $\alpha$-equality and freshness constraints on nominal terms endowed with a nominal set semantics that facilitates reasoning about languages with binders. Nominal unification is decidable and unitary, however, its…

Let $A$ be an additive basis. We call ``essential subset'' of $A$ any finite subset $P$ of $A$ such that $A \setminus P$ is not an additive basis and that $P$ is minimal (for the inclusion order) to have this property. A recent theorem due…

We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…