相关论文: Maximal divisorial sets in arc spaces

This paper studies the distribution of chain and maximal chain lengths in a causal set. We first provide a new derivation for these distributions for a causal set uniformly embedded in Minkowski space, for various dimensionalities, which…

It is expected that a totally invariant divisor of a non-isomorphic endomorphism of the complex projective space is a union of hyperplanes. In this paper, we compute an upper bound for the degree of such a divisor. As a consequence, we…

In this work, we present a translation of the complete pipeline for variational shape approximation (VSA) to the setting of point sets. First, we describe an explicit example for the theoretically known non-convergence of the currently…

Algorithm selection is crucial in the field of optimization, as no single algorithm performs perfectly across all types of optimization problems. Finding the best algorithm among a given set of algorithms for a given problem requires a…

The main goal of the paper is to find the {\it absolute maximum} of the width of the separatrix chaotic layer as function of the frequency of the time-periodic perturbation of a one-dimensional Hamiltonian system possessing a separatrix,…

We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.

We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles…

In this paper, we study two extensions of the maximum bichromatic separating rectangle (MBSR) problem introduced in \cite{Armaselu-CCCG, Armaselu-arXiv}. One of the extensions, introduced in \cite{Armaselu-FWCG}, is called \textit{MBSR with…

If $s$ is a positive integer and $A$ is a set of positive integers, we say that $B$ is an $s$-divisor of $A$ if $\sum_{b\in B} b\mid s\sum_{a\in A} a$. We study the maximal number of $k$-subsets of an $n$-element set that can be…

The aim of this paper is to study Weil divisors on a singular rational normal scroll X. In particular the author describes explicitly the group of divisorial sheaves associated to Weil divisors on X, via the direct image of the Picard group…

We introduce a notion of dimension for the solution set of a system of algebraic difference equations that measures the degrees of freedom when determining a solution in the ring of sequences. This number need not be an integer, but, as we…

We establish deviation inequalities for the maxima of partial sums of a martingale differences sequence, and of a strictly stationary orthomartingale random field. These inequalities can be used to establish complete convergence of…

We design a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints. Due to the uncertainty of parameters in set constraints, we aim to find a generalized Nash equilibrium in the worst…

In this paper we introduce and study the concept of set extremality for systems of convex sets in vector spaces without topological structures. Characterizations of the extremal systems of sets are obtained in the form of the convex…

We study a generalization of the knapsack problem with geometric and vector constraints. The input is a set of rectangular items, each with an associated profit and $d$ nonnegative weights ($d$-dimensional vector), and a square knapsack.…

It is proved that the special fibre of the Nash transform of an irreducible isolated singularity has maximal dimension.

Let $(X_i, \mathcal{F}_i)_{i\geq1}$ be a martingale difference sequence in a smooth Banach space. Let $S_n=\sum_{i=1}^nX_i, n\geq 1,$ be the partial sums of $(X_i, \mathcal{F}_i)_{i\geq 1}$. We give upper bounds on the quantity…

The maximum selection principle allows to give expansions, in an adaptive way, of functions in the Hardy space $\mathbf H_2$ of the disk in terms of Blaschke products. The expansion is specific to the given function. Blaschke factors and…

Diversity maximization is an important concept in information retrieval, computational geometry and operations research. Usually, it is a variant of the following problem: Given a ground set, constraints, and a function $f(\cdot)$ that…

We study an infinite-horizon discrete-time optimal stopping problem under non-exponential discounting. A new method, which we call the iterative approach, is developed to find subgame perfect Nash equilibria. When the discount function…