Related papers: Derangements and Generalizations: A Counting Note …
Motivated by the application of Hall's Marriage Theorem in various LP-rounding problems, we introduce a generalization of the classical marriage problem (CMP) that we call the Fractional Marriage Problem. We show that the Fractional…
We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…
The study of fixed point ratios is a classical topic in permutation group theory, with a long history stretching back to the origins of the subject in the 19th century. Fixed point ratios arise naturally in many different contexts, finding…
In this paper, we begin by introducing a well-known geometry concept: the Fermat point in a triangle. Then, we generalize the problem and propose an iterative algorithm based on gradient descent to the weighted form in Lp space. We also…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
In this paper by using the measure of noncompactness concept, we present new fixed point theorems for multivalued maps. In further we introduce a new class of mappings which are general than Meir-Keeler mappings. Finally, we use these…
In this expository article, we discuss the rank-derangement problem, which asks for the number of permutations of a deck of cards such that each card is replaced by a card of a different rank. This combinatorial problem arises in computing…
The compound decision problem for a vector of independent Poisson random variables with possibly different means has half a century old solution. However, it appears that the classical solution needs smoothing adjustment even when there are…
We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…
Computing the rate-distortion function for continuous sources is commonly regarded as a standard continuous optimization problem. When numerically addressing this problem, a typical approach involves discretizing the source space and…
Inspired by real-world applications such as the assignment of pupils to schools or the allocation of social housing, the one-sided matching problem studies how a set of agents can be assigned to a set of objects when the agents have…
This paper contains a short and simplified proof of desingularization over fields of characteristic zero, together with various applications to other problems in algebraic geometry (among others, the study of the behavior of…
This paper examines a stochastic deconvolution problem on compact symmetric spaces which is referred to as decompounding. This involves estimating the step distributions of a random walk, where in addition the number of steps between…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
Recently, Brand, Ganian and Simonov introduced a parameterized refinement of the classical PAC-learning sample complexity framework. A crucial outcome of their investigation is that for a very wide range of learning problems, there is a…
Statistical inferences for high-dimensional regression models have been extensively studied for their wide applications ranging from genomics, neuroscience, to economics. However, in practice, there are often potential unmeasured…
Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…
We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…
We show that each perfect matching in a bipartite graph $G$ intersects at least half of the perfect matchings in $G$. This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…