相关论文: Simplification of exponential factors of irregular…

We prove that the algorithm for desingularization of algebraic varieties in characteristic zero of the first two authors is functorial with respect to regular morphisms. For this purpose, we show that, in characteristic zero, a regular…

Let $A = \Bbbk Q / I$ be the path algebra of any finite quiver $Q$ modulo any two-sided ideal $I$ of relations and let $R$ be any reduction system satisfying the diamond condition for $I$. We introduce an intrinsic notion of deformation of…

We study optimization problems that are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity assumptions. Specifically, we focus on Maximum Independent…

The solution of many physical evolution equations can be expressed as an exponential of two or more operators acting on initial data. Accurate solutions can be systematically derived by decomposing the exponential in a product form. For…

Unfolding singular points in linear differential equations is a classical technique for studying the properties of irregular singularities by relating them to regular singularities. In this paper, we propose a general framework for…

The infinite reduction of couplings is a tool to consistently renormalize a wide class of non-renormalizable theories with a reduced, eventually finite, set of independent couplings, and classify the non-renormalizable interactions. Several…

An efficient integer factorization algorithm would reduce the security of all variants of the RSA cryptographic scheme to zero. Despite the passage of years, no method for efficiently factoring large semiprime numbers in a classical…

We present a new proof of results of Kurdyka & Paunescu, and of Rainer, about real-analytic multi-parameters generalizations of classical results by Rellich and Kato about the reduction in families of univariate deformations of normal…

We prove a generalization of Orlov's theorem for matrix factorizations with $n$ steps. Let $X$ be a regular scheme, $W\colon X\to \mathbb{A}^1$ a flat morphism and $D:=W^{-1}(0)$ its central fiber. We construct an appropriate triangulated…

For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…

We propose a simple approach to formal deformations of associative algebras. It exploits the machinery of multiplicative coresolutions of an associative algebra A in the category of A-bimodules. Specifically, we show that certain…

We prove that $K_n+I$, the complete graph of an even order with a $1$-factor duplicated, admits a decomposition into $2$-factors, each a disjoint union of cycles of length $m \geq 5$ if and only if $m \mid n$, except possibly when $m$ is…

Fix natural numbers $n \geq 1$, $t \geq 2$ and a primitive $t^{\text{th}}$ root of unity $\omega$. In previous work with A. Ayyer (J. Alg., 2022), we studied the factorization of specialized irreducible characters of $\text{GL}_{tn}$,…

Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional B{\'e}zout…

In Eikonal equations, rarefaction is a common phenomenon known to degrade the rate of convergence of numerical methods. The `factoring' approach alleviates this difficulty by deriving a PDE for a new (locally smooth) variable while…

Formal orbifolds are defined in higher dimension. Their \'etale fundamental groups are also defined. It is shown that the fundamental groups of formal orbifolds have certain finiteness property and it is also shown that they can be used to…

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…

Answering a question of Benjamini, we present an isometry-invariant random partition of the Euclidean space $\mathbb{R}^d$, $d\geq 3$, into infinite connected indistinguishable pieces, such that the adjacency graph defined on the pieces is…

New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…

In this work, we relate girth and path-degeneracy in classes with sub-exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor-closed classes that are tight up to a constant factor (and tight up to…