中文
相关论文

相关论文: Maximal divisorial sets in arc spaces

200 篇论文

A classical set of birational invariants of a variety are its spaces of pluricanonical forms and some of their canonically defined subspaces. Each of these vector spaces admits a typical metric structure which is also birationally…

代数几何 · 数学 2009-11-13 Chen-Yu Chi , Shing-Tung Yau

We give an explicit classification of maximal antipodal sets in any irreducible compact symmetric space except for spin groups and half spin groups, and some quotient symmetric spaces associated to them.

群论 · 数学 2021-08-26 Jun Yu

We compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with pre-fixed structure. Using this representation, we show conditions under which a game has the maximum possible number of this…

代数几何 · 数学 2007-05-23 G. Jeronimo , D. Perrucci , J. Sabia

We study the diametric problem (i.e., optimal anticodes) in the space of permutations under the Ulam distance. That is, let $S_n$ denote the set of permutations on $n$ symbols, and for each $\sigma, \tau \in S_n$, define their Ulam distance…

组合数学 · 数学 2024-03-05 Pat Devlin , Leo Douhovnikoff

In machine learning, Optimal Transport (OT) theory is extensively utilized to compare probability distributions across various applications, such as graph data represented by node distributions and image data represented by pixel…

机器学习 · 计算机科学 2025-01-30 Jianming Huang , Xun Su , Zhongxi Fang , Hiroyuki Kasai

The maximum cut problem for a quintic del Pezzo surface ${\rm Bl}_{4}(\mathbb{P}^2)$ asks: Among all partitions of the 10 exceptional curves into two disjoint sets, what is the largest possible number of pairwise intersections? In this…

组合数学 · 数学 2012-07-18 Mauricio Junca Mauricio Velasco

The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…

综合数学 · 数学 2020-09-04 Oleksandr Makhnei , Roman Zatorskii

In this paper the necessary conditions of optimality in the form of maximum principle are derived for a very general class of variational problems. This class includes problems with any optimization criteria and constraints that can be…

最优化与控制 · 数学 2009-11-30 Anatoly Tsirlin

In this paper, the problem of finding a generalized Nash equilibrium (GNE) of a networked game is studied. Players are only able to choose their decisions from a feasible action set. The feasible set is considered to be a private linear…

计算机科学与博弈论 · 计算机科学 2017-03-27 Farzad Salehisadaghiani , Lacra Pavel

We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations.…

神经与进化计算 · 计算机科学 2007-05-23 V. C. Barbosa , L. C. D. Campos

Using the structure of the jet schemes of rational double point singularities, we construct "minimal embedded toric resolutions" of these singularities. We also establish, for these singularities, a correspondence between a natural class of…

代数几何 · 数学 2017-05-15 Hussein Mourtada , Camille Plénat

The paper elucidates the relationship between the density of a Banach space and possible sizes of well-separated subsets of its unit sphere. For example, it is proved that for a large enough space $X$, the unit sphere $S_X$ always contains…

泛函分析 · 数学 2021-01-13 Petr Hájek , Tomasz Kania , Tommaso Russo

We provide a convenient framework for the study of the well-posedness of a variety of abstract (integro)differential equations in general Banach function spaces. It allows us to extend and complement the known theory on the maximal…

泛函分析 · 数学 2022-10-20 Sebastian Król

In this paper we investigate some dichotomy concepts for linear difference equations in Banach spaces. We motivate our approach by illustrative examples.

动力系统 · 数学 2011-08-26 Ioan-Lucian Popa , Mihail Megan , Traian Ceausu

The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of graphs considered is restricted to intersection graphs of sets of axis-aligned…

数据结构与算法 · 计算机科学 2024-10-10 Rishi Advani , Abolfazl Asudeh

This work proposes a novel distributed approach for computing a Nash equilibrium in convex games with restricted strongly monotone pseudo-gradients. By leveraging the idea of the centralized operator extrapolation method presented in [4] to…

最优化与控制 · 数学 2023-10-25 Tatiana Tatarenko , Angelia Nedich

We propose to compute approximations to general invariant sets in dynamical systems by minimizing the distance between an appropriately selected finite set of points and its image under the dynamics. We demonstrate, through computational…

动力系统 · 数学 2017-06-28 Oliver Junge , Ioannis G. Kevrekidis

Let (S,0) be a germ of complex analytic normal surface. On its minimal resolution, we consider the reduced exceptional divisor E and its irreducible components E_i. The Nash map associates to each irreducible component C_k of the space of…

代数几何 · 数学 2009-09-15 Camille Plenat , Patrick Popescu-Pampu

This paper studies two topics concerning on the orthogonal complement of one dimensional subspace with respect to a given quadratic form on a vector space over a number field. One is to determine the invariants for the isomorphism class of…

数论 · 数学 2018-03-29 Manabu Murata

This paper tackles the problem of adversarial examples from a game theoretic point of view. We study the open question of the existence of mixed Nash equilibria in the zero-sum game formed by the attacker and the classifier. While previous…

计算机科学与博弈论 · 计算机科学 2021-02-16 Laurent Meunier , Meyer Scetbon , Rafael Pinot , Jamal Atif , Yann Chevaleyre
‹ 上一页 1 8 9 10 下一页 ›