中文
相关论文

相关论文: Convex choice, finite choice and sorting

200 篇论文

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

最优化与控制 · 数学 2023-03-24 Hamza Fawzi , João Gouveia , Pablo A. Parrilo , James Saunderson , Rekha R. Thomas

The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…

环与代数 · 数学 2007-05-23 U. D. Bekbaev , I. S. Rakhimov

We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.

最优化与控制 · 数学 2012-03-20 Timm Oertel , Christian Wagner , Robert Weismantel

We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…

组合数学 · 数学 2017-03-22 Michael Engen , Vincent Vatter

Recently, a new conjecture on the degrees of the irreducible Brauer characters of a finite group was presented by the second author. In this paper we propose a 'local' version of this conjecture for blocks B of finite groups, giving a lower…

群论 · 数学 2007-05-23 Thorsten Holm , Wolfgang Willems

We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with $k\geq1$ selector fields ($\seplogk{k}$). Second, we show that this entails the decidability of the finite…

计算机科学中的逻辑 · 计算机科学 2018-05-01 Mnacho Echenim , Radu Iosif , Nicolas Peltier

We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded connected (and monotone) mixed search number and we deal with the…

组合数学 · 数学 2015-08-12 Micah J. Best , Arvind Gupta , Dimitrios M. Thilikos , Dimitris Zoros

Let $C$ be a cone in a locally convex Hausdorff topological vector space $X$ containing $0$. We show that there exists a (essentially unique) nonempty family $\mathscr{K}$ of nonempty subsets of the topological dual $X^\prime$ such that $$…

经典分析与常微分方程 · 数学 2023-01-19 Paolo Leonetti , Giulio Principi

We present two first-order, sequential optimization algorithms to solve constrained optimization problems. We consider a black-box setting with a priori unknown, non-convex objective and constraint functions that have Lipschitz continuous…

最优化与控制 · 数学 2020-11-19 Abraham P. Vinod , Arie Israel , Ufuk Topcu

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

组合数学 · 数学 2013-04-22 Doowon Koh , Hae-Sang Sun

We investigate certain envelopes of open sets in dual Banach spaces which are related to extending holomorphic functions. We give a variety of examples of absolutely convex sets showing that the extension is in many cases not possible. We…

泛函分析 · 数学 2010-05-10 D. Garcia , O. F. K. Kalenda , M. Maestre

Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…

最优化与控制 · 数学 2017-05-22 Nguyen Ngoc Luan , Jen-Chih Yao , Nguyen Dong Yen

We continue to investigate cases when the Repov\v{s}-Semenov splitting problem for selections has an affirmative solution for continuous set-valued mappings. We consider the situation in infinite-dimensional uniformly convex Banach spaces.…

一般拓扑 · 数学 2009-08-11 Maxim V. Balashov , Dušan Repovš

Convex algebras, also called (semi)convex sets, are at the heart of modelling probabilistic systems including probabilistic automata. Abstractly, they are the Eilenberg-Moore algebras of the finitely supported distribution monad.…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Ana Sokolova , Harald Woracek

We introduce and investigate the orbit-closed $C$-numerical range, a natural modification of the $C$-numerical range of an operator introduced for $C$ trace-class by Dirr and vom Ende. Our orbit-closed $C$-numerical range is a conservative…

泛函分析 · 数学 2021-07-16 Jireh Loreaux , Sasmita Patnaik

We introduce the finitistic extension degree of a ring and investigate rings for which it is finite. The Auslander-Reiten Conjecture is proved for rings of finite finitistic extension degree and these rings are also shown to have finite…

交换代数 · 数学 2013-09-05 Kosmas Diveris

We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…

逻辑 · 数学 2024-09-02 Noah Schweber

Many results on the convex order in the literature were stated for random variables with finite mean. For instance, a fundamental result in dependence modeling is that the sum of a pair of random random variables is upper bounded in convex…

概率论 · 数学 2026-02-27 Benjamin Côté , Ruodu Wang

The finitistic dimension of a triangulated category is introduced. For the category of perfect complexes over a ring it is shown that this dimension is finite if and only if the small finitistic dimension of the ring is finite.

范畴论 · 数学 2024-09-04 Henning Krause