Related papers: Perron transforms and Hironaka's game
The main result of this paper is that in order to prove the local uniformization theorem for local rings it is enough to prove it for rank one valuations. Our proof does not depend on the nature of the class of local rings for which we want…
In this paper, we present the QR Algorithm with Permutations that shows an improved convergence rate compared to the classical QR algorithm. We determine a bound for performance based on best instantaneous convergence, and develop low…
We introduce the notion of order-preserving multi-homogeneous mapping which allows to study Perron-Frobenius type theorems and nonnegative tensors in unified fashion. We prove a weak and strong Perron-Frobenius theorem for these maps and…
We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…
In complex systems such as spin systems and protein systems, conventional simulations in the canonical ensemble will get trapped in states of energy local minima. We employ the generalized-ensemble algorithms in order to overcome this…
The randomised Horn problem, in both its additive and multiplicative version, has recently drawn increasing interest. Especially, closed analytical results have been found for the rank-1 perturbation of sums of Hermitian matrices and…
We show that simple modifications to van der Hoeven's forward and inverse truncated Fourier transforms allow the algorithms to be performed in-place, and with only a linear overhead in complexity.
Evolutionary game theory is a common framework to study the evolution of cooperation, where it is usually assumed that the same game is played in all interactions. Here, we investigate a model where the game that is played by two…
Transforms using random matrices have been found to have many applications. We are concerned with the projection of a signal onto Gaussian-distributed random orthogonal bases. We also would like to easily invert the process through…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
In 1998 Zielonka simplified the proofs of memoryless determinacy of infinite parity games. In 2018 Haddad simplified some proofs of memoryless determinacy of finite parity games. This article adapts Haddad's technique for infinite parity…
The theory of random matrices contains many central limit theorems. We have central limit theorems for eigenvalues statistics, for the log-determinant and log-permanent, for limiting distribution of individual eigenvalues in the bulk, and…
We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020] but not the general case. We prove, in particular, that the…
In this paper, we show that different types of evolutionary game dynamics are, in principle, special cases of a dynamical system model based on our previously reported framework of generalized growth transforms. The framework shows that…
Matching games is a one-to-one two sided market model introduced by Garrido-Lucero and Laraki, in which coupled agents' utilities are endogenously determined as the outcome of a strategic game. They refine the classical pairwise stability…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
In this paper we give a systematized treatment to some coincidence situations for multiple summing multilinear mappings which extend, generalize and simplify the methods and results obtained thus far. The application of our general results…
We introduce the category of optiongraphs and option-preserving maps as a model to study impartial combinatorial games. Outcomes, remoteness, and extended nim-values are preserved under option-preserving maps. We show that the four…
We give an uniform General Neron Desingularization for one dimensional local rings with respect to morphisms which coincide modulo a high power of the maximal ideal. The result has interesting applications in the case of Cohen-Macaulay…
The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…