Related papers: Contrasting Two Transformation-Based Methods for O…
In this paper, we give explicit combinatorial descriptions for toric extremal contractions under the relative setting, where varieties do not need to be complete. Fujino's completion theorem is the key to the main result. As applications,…
We present a novel method of computing the beta-normal eta-long form of a simply-typed lambda-term by constructing traversals over a variant abstract syntax tree of the term. In contrast to beta-reduction, which changes the term by…
We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected…
In order to improve the advantages and the reliability of the second derivative method in tracking the position of extrema from experimental curves, we develop a novel analysis method based on the mathematical concept of curvature. We…
Parameter estimation is one of the most important tasks in statistics, and is key to helping people understand the distribution behind a sample of observations. Traditionally parameter estimation is done either by closed-form solutions…
We propose a method to identify and characterize distribution shifts in classification datasets based on optimal transport. It allows the user to identify the extent to which each class is affected by the shift, and retrieves corresponding…
The rate of uniform convergence in extreme value statistics is non-universal and can be arbitrarily slow. Further, the relative error can be unbounded in the tail of the approximation, leading to difficulty in extrapolating the extreme…
Extreme-value copulas arise as the limiting dependence structure of component-wise maxima. Defined in terms of a functional parameter, they are one of the most widespread copula families due to their flexibility and ability to capture…
We address the problem of prediction for extreme observations by proposing an extremal linear prediction method. We construct an inner product space of nonnegative random variables derived from transformed-linear combinations of independent…
We give an exact formula for the Bellman function of the weak type of martingale transform. We also give the extremal functions (actually extremal sequences of functions). We find them using the precise form of the Bellman function. The…
Two main algorithmic approaches are known for making Hironaka's proof of resolution of singularities in characteristic zero constructive. Their main difference is the use of different notions of transforms during the resolution process and…
In this paper, the Newton-Anderson method, which results from applying an extrapolation technique known as Anderson acceleration to Newton's method, is shown both analytically and numerically to provide superlinear convergence to non-simple…
Extreme value analysis for time series is often based on the block maxima method, in particular for environmental applications. In the classical univariate case, the latter is based on fitting an extreme-value distribution to the sample of…
This paper studies the robustness of SIFT and SURF against different image transforms (rigid body, similarity, affine and projective) by quantitatively analyzing the variations in the extent of transformations. Previous studies have been…
We present methodology for constructing exact significance tests for cross tabulated data for "difficult" composite alternative hypotheses that have no natural test statistic. We construct a test for discovering Simpson's Paradox and a…
We analyze algorithms that output absolutely normal numbers digit-by-digit with respect to quality of convergence to normality of the output, measured by the discrepancy. We consider explicit variants of algorithms by Sierpinski, by Turing…
Extremality and irreducibility constitute fundamental concepts in mathematics, particularly within tropical geometry. While extremal decomposition is typically computationally hard, this article presents a fast algorithm for identifying the…
This paper presents new variants of the averaged alternating modified reflections (AAMR) method for the best approximation problem. Under a mild constraint qualification, we first show its weak convergence and then establish a convergence…
When permutation methods are used in practice, often a limited number of random permutations are used to decrease the computational burden. However, most theoretical literature assumes that the whole permutation group is used, and methods…
Different formulations of special relativity are theoretically discussed. First an invariant formulation, i.e., the ''true transformations (TT) relativity,'' is exposed. There a physical quantity is represented by a true tensor which…