Related papers: Adapted Sequence for Polyhedral Realization of Cry…
This paper is about the bar recursion operator in the context of classical realizability. After the pioneering work of Berardi, Bezem & Coquand [1], T. Streicher has shown [10], by means of their bar recursion operator, that the…
Borradaile et al. (2017) investigated orientations of an undirected graph in which the sequence of in-degrees of the nodes is lexicographically minimal, which we call decreasingly minimal (=dec-min). They proved that an orientation is…
In this paper, we propose a novel, unified, general approach to investigate sufficient and necessary conditions under which four types of convex sets, polyhedra, polyhedral cones, ellipsoids and Lorenz cones, are invariant sets for a linear…
In this paper, we develop a new adaptive regularization method for minimizing a composite function, which is the sum of a $p$th-order ($p \ge 1$) Lipschitz continuous function and a simple, convex, and possibly nonsmooth function. We use a…
In this paper we give a matrix version of Handelman's Positivstellensatz [1], representing polynomial matrices which are positive definite on convex, compact polyhedra. Moreover, we propose also a procedure to find such a representation. As…
The concept of Automorphic Lie Algebras arises in the context of reduction groups introduced in the early 1980s in the field of integrable systems. Automorphic Lie Algebras are obtained by imposing a discrete group symmetry on a current…
This paper provides versions of classical results from linear algebra, real analysis and convex analysis in a free module of finite rank over the ring $L^0$ of measurable functions on a $\sigma$-finite measure space. We study the question…
We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the…
This work introduces a new cubic regularization method for nonconvex unconstrained multiobjective optimization problems. At each iteration of the method, a model associated with the cubic regularization of each component of the objective…
We propose a new variant of Chubanov's method for solving the feasibility problem over the symmetric cone by extending Roos's method (2018) of solving the feasibility problem over the nonnegative orthant. The proposed method considers a…
The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…
A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…
A fundamental challenge in materials design is linking building block attributes to crystal structure. Addressing this challenge is particularly difficult for systems that exhibit emergent order, such as entropy-stabilized colloidal…
The starting point of this paper are the Mittag-Leffler polynomials introduced by H. Bateman [1]. Based on generalized integer powers of real numbers and deformed exponential function, we introduce deformed Mittag-Leffler polynomials…
Polyhedral estimate is a generic efficiently computable nonlinear in observations routine for recovering unknown signal belonging to a given convex compact set from noisy observation of signal's linear image. Risk analysis and optimal…
This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…
In this paper we introduce the class of infinite infimal convolution functionals and apply these functionals to the regularization of ill-posed inverse problems. The proposed regularization involves an infimal convolution of a continuously…
Reliable and robust methods of predicting the crystal structure of a compound, based only on its chemical composition, is crucial to the study of materials and their applications. Despite considerable ongoing research efforts, crystal…
We study the crystal base of the negative part of a quantum group. An explicit realization of the crystal is given in terms of Young tableaux for types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$. Connection between our realization and a previous…
An associahedron is a polytope whose vertices correspond to triangulations of a convex polygon and whose edges correspond to flips between them. Using labeled polygons, C. Hohlweg and C. Lange constructed various realizations of the…