Related papers: Perron transforms and Hironaka's game
We present two collective games with new paradoxical features when they are combined. Besides reproducing the so--called Parrondo effect, where a winning game is obtained from the alternation of two fair games, a new effect appears, i.e.,…
In this paper we provide a case study of the use of relatively sophisticated mathematics and algorithms to redefine and adapt a simple traditional game/puzzle to exploit the computational power of smart devices. The focus here is not so…
We study generalized Horn-Kapranov rational parametrizations of inhomogeneous sparse discriminants from both a theoretical and an algorithmic perspective. We show that all these parametrizations are birational and prove some results on the…
We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…
This paper investigates the failure cases and out-of-distribution behavior of transformers trained on matrix inversion and eigenvalue decomposition. I show that incorrect model predictions still retain deep mathematical properties of the…
Foundational work on the Lottery Ticket Hypothesis has suggested an exciting corollary: winning tickets found in the context of one task can be transferred to similar tasks, possibly even across different architectures. This has generated…
In this paper, some more properties of the generalized principal pivot transform are derived. Necessary and sufficient conditions for the equality between Moore-Penrose inverse of a generalized principal pivot transform and its…
The problem of characterizing all new-time transformations preserving the Poisson structure of a finitedimensional Poisson system is completely solved in a constructive way. As a corollary, this leads to a broad generalization of previously…
We present various new results on greedoids. We prove a theorem that generalizes an equivalent formulation of Edmonds' classic matroid polytope theorem to local forest greedoids -- a class of greedoids that contains matroids as well as…
In this short paper we present an algorithm for finding a solution to a generalized Sudoku.
Recently the matcher game was introduced. In this game, two players create a maximal matching by one player repeatedly choosing a vertex and the other player choosing a $K_2$ containing that vertex. One player tries to minimize the result…
We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also…
We give a combinatorial algorithm for equivariant embedded resolution of singularities of a toric variety defined over a perfect field. The algorithm is realized by a finite succession of blowings-up with smooth invariant centres that…
In this article, we consider some simple combinatorial game and a winning strategy in this game. This game is then used to prove several known results about non-repetitive sequences and approximations with denominators from a lacunary…
We present three versions of the classic two-pile game \textsc{one-or-one-or-one-of-both} generalized to the multi-pile context. In each case, we explore the resulting $\mathcal{P}$-positions. In the first version, there is a simple…
In this paper the local regularity of the Hilbert transform is considered, and local smoothness and real analyticity results are obtained.
We prove a parametric generalization of the classical Poincare-Perron theorem on stabilizing recurrence relations where we assume that the varying coefficients of a recurrence depend on auxiliary parameters and converge uniformly in these…
Structured canonical forms under unitary and suitable structure-preserving similarity transformations for normal and (skew-)Hamiltonian as well as normal and per(skew)-Hermitian matrices are proposed. Moreover, an algorithm for computing…
We prove an equivariant version of Hironaka's theorem on elimination of points of indeterminacy. Our arguments rely on canonical resolution of singularities.
A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.