相关论文: Convex choice, finite choice and sorting
The study of the additive volume of sets can be reduced to the case of one-dimensional sets. The exact values of the volume of extremal sets are given as a conjecture.
In this paper we describe a general strategy for approaching the Weinstein conjecture in dimension three. We apply this approach to prove the Weinstein conjecture for a new class of contact manifolds (planar contact manifolds). We also…
The concept of cutting is first explicitly introduced. By the concept, a convex expansion for finite distributive lattices is considered. Thus, a more general method for drawing the Hasse diagram is given, and the rank generating function…
The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…
We prove that any analytic set in $\C^n$ with a unique tangent cone at infinity is an algebraic set. We prove that the degree of a complex algebraic set in $\C^n$, which is Lipschitz normally embedded at infinity, is equal to the degree of…
In order to better understand the structure of closed collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice. In this note, we find the maximal closed sets over a finite alphabet.…
We study several problems motivated by Crouzeix's conjecture, which we consider in the special setting of model spaces and compressions of the shift with finite Blaschke products as symbols. We pose a version of the conjecture in this…
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
In the present paper, classical tools of convex analysis are used to study the solution set to a certain class of set-inclusive generalized equations. A condition for the solution existence and global error bounds is established, in the…
We extend the classical preferential attachment random graph model to random simplicial complexes. At each stage of the model, we choose one of the existing $k$-simplices with probability proportional to its $k$-degree. The chosen…
Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…
The finitistic dimension conjecture asserts that any finite-dimensional algebra over a field should have finite finitistic dimension. Recently, this conjecture is reduced to studying finitistic dimensions for extensions of algebras. In this…
We consider bounded integer knapsacks where the weights and variable upper bounds together form a superincreasing sequence. The elements of this superincreasing knapsack are exactly those vectors that are lexicographically smaller than the…
This work explores bounds on the Rouquier dimension in the bounded derived category of coherent sheaves on Noetherian schemes. By utilizing approximations, we exhibit that Rouquier dimension is inherently characterized by the number of…
We study the complexity of identifying the integer feasibility of reverse convex sets. We present various settings where the complexity can be either NP-Hard or efficiently solvable when the dimension is fixed. Of particular interest is the…
We give a proof to the following theorem, which is well-known among experts: A connected subcomplex $W$ of a finite dimensional CAT(0) cubed complex $X$ is convex if and only if Lk$(v, W)$ is a full subcomplex of Lk$(v, X)$ for every vertex…
We introduce two new operations (compositional products and implication) on Weihrauch degrees, and investigate the overall algebraic structure. The validity of the various distributivity laws is studied and forms the basis for a comparison…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…
It is proved in Chon{\'e} and Le Meur (2001) that the problem of minimizing a Dirichlet-like functional of the function $u\_h$ discretized with $P\_1$ Finite Elements, under the constraint that $u\_h$ be convex, cannot converge. Here, we…