English
Related papers

Related papers: Maximal divisorial sets in arc spaces

200 papers

This article gives dual representations for convex integral functionals on the linear space of regular processes. This space turns out to be a Banach space containing many more familiar classes of stochastic processes and its dual can be…

Probability · Mathematics 2017-01-18 Teemu Pennanen , Ari-Pekka Perkkiö

A celebrated theorem in Real Algebraic and Analytic Geometry (originally due to Bruhat-Cartan and Wallace and stated later in its current form by Milnor) is the (Nash) curve selection lemma. It states that each point in the closure of a…

Algebraic Geometry · Mathematics 2025-04-07 José F. Fernando

This paper exemplifies that saturation is an indispensable structure on measure spaces to obtain the existence and characterization of solutions to nonconvex variational problems with integral constraints in Banach spaces and their dual…

Optimization and Control · Mathematics 2019-09-24 Nobusumi Sagara

This paper develops a distributed Nash Equilibrium seeking algorithm for heterogeneous multi-robot systems. The algorithm utilises distributed optimisation and output control to achieve the Nash equilibrium by leveraging information shared…

Robotics · Computer Science 2025-09-22 Yi Dong , Zhongguo Li , Sarvapali D. Ramchurn , Xiaowei Huang

We propose a systematic construction of native Banach spaces for general spline-admissible operators ${\rm L}$. In short, the native space for ${\rm L}$ and the (dual) norm $\|\cdot\|_{\mathcal{X}'}$ is the largest space of functions $f:…

Functional Analysis · Mathematics 2019-04-25 Michael Unser , Julien Fageot

Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…

Machine Learning · Statistics 2019-02-28 David Alvarez-Melis , Stefanie Jegelka , Tommi S. Jaakkola

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

A high number of discrete optimization problems, including Vertex Cover, Set Cover or Feedback Vertex Set, can be unified into the class of covering problems. Several of them were shown to be inapproximable by deterministic algorithms. This…

Data Structures and Algorithms · Computer Science 2013-05-14 Etienne Birmelé

We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…

Rings and Algebras · Mathematics 2023-09-12 Alexander Levin

The purpose of the paper is to rectify a series of errors occurred in [2], [17], [20] for a particular situation. To get a fruitful solution and to overcome the issue, we introduce a new form of set sharing namely restricted set sharing,…

Complex Variables · Mathematics 2021-03-02 Abhijit Banerjee , Arpita Kundu

Variational and divergence symmetries are studied in this paper for the whole class of linear and nonlinear equations of maximal symmetry, and the associated first integrals are given in explicit form. All the main results obtained are…

Differential Geometry · Mathematics 2022-12-29 J. C. Ndogmo

In this paper, we give a definition of volume for subsets in the space of arcs of an algebraic variety, and study its properties. Our main result relates the volume of a set of arcs on a Cohen-Macaulay variety to its jet-codimension, a…

Algebraic Geometry · Mathematics 2015-06-23 Tommaso de Fernex , Mircea Mustata

We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.

Combinatorics · Mathematics 2013-12-24 Sanming Zhou

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

Number Theory · Mathematics 2015-06-16 Kevin O'Bryant

For a rational number $r>1$, a set $A$ of positive integers is called an $r$-multiple-free set if $A$ does not contain any solution of the equation $rx = y$. The extremal problem on estimating the maximum possible size of $r$-multiple-free…

Number Theory · Mathematics 2015-03-17 Sang June Lee

In this paper, we consider a Nash equilibrium seeking problem for a class of high-order multi-agent systems with unknown dynamics. Different from existing results for single integrators, we aim to steer the outputs of this class of…

Systems and Control · Electrical Eng. & Systems 2021-01-11 Yutao Tang , Peng Yi

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

Numerical Analysis · Mathematics 2025-01-22 Leokadia Bialas-Ciez , Agnieszka Kowalska , Alvise Sommariva

This paper focuses on the maximal distribution on sublinear expectation space and introduces a new type of random fields with the maximally distributed finite-dimensional distribution. The corresponding spatial maximally distributed white…

Probability · Mathematics 2022-02-23 Xinpeng Li , Shige Peng

We study the ramification divisors of projections of a smooth projective variety onto a linear subspace of the same dimension. We prove that the ramification divisors vary in a maximal dimensional family for a large class of varieties.…

Algebraic Geometry · Mathematics 2019-01-08 Anand Deopurkar , Eduard Duryev , Anand Patel

The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main result is that, for binary matrices, there is a complexity…

Discrete Mathematics · Computer Science 2017-01-24 Vincent Froese , René van Bevern , Rolf Niedermeier , Manuel Sorge