相关论文: Simple Hironaka resolution in characteristic zero
Given a Cohen-Macaulay local ring, the cohomology annihilator ideal and the annihilator of the stable category of maximal Cohen-Macaulay modules are two ideals closely related both with each other and the singularities of the ring. Kimura…
The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…
The purpose of this study is twofold. First, we revisit a shape optimization reformulation of a prototypical shape inverse problem and briefly propose a simple yet efficient numerical approach for solving the corresponding minimization…
We develop the method of inducing semiorthogonal decompositions of projective varieties with isolated rational singularities from those of small resolutions of singularities, which generalizes semiorthogonal decompositions for singular…
We propose a formalization of generic algorithms that includes analog algorithms. This is achieved by reformulating and extending the framework of abstract state machines to include continuous-time models of computation. We prove that every…
The purpose of this note is to give a simple proof of the following theorem: Let $X$ be a normal projective variety over an algebraically closed field $k$, $\op{char} k = 0$ and let $D \subset X$ be a proper closed subvariety of $X$. Then…
The following paper presents a heuristic method by which sum-of-product Boolean expressions can be simplified with a specific focus on the removal of redundant and selective prime implicants. Existing methods, such as the Karnaugh map and…
In [BDyDF08] Belabas, Diaz y Diaz and Friedman show a way to determine, assuming the Generalized Riemann Hypothesis, a set of prime ideals that generate the class group of a number field. Their method is efficient because it produces a set…
We discuss invariants of Cohen-Macaulay local rings that admit a canonical module $\omega$. Attached to each such ring R, when $\omega$ is an ideal, there are integers--the type of R, the reduction number of $\omega$--that provide valuable…
We propose an algorithm for a family of optimization problems where the objective can be decomposed as a sum of functions with monotonicity properties. The motivating problem is optimization of hyperparameters of machine learning…
We study Hamamoto's expanding square argument towards a 1-D minimisation problem related to the sharp solenoidal uncertainty principle. Working in the right function space, we recast the involved interpolation type inequality into an exact…
We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.
Earnest and Khosravani, Iwabuchi, and Kim and Park recently gave a complete classification of the universal binary Hermitian forms. We give a unified proof of the universalities of these Hermitian forms, relying primarily on Ramanujan's…
We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and…
We introduce layered automata, a subclass of alternating parity automata that generalises deterministic automata. Assuming a consistency property, these automata are history deterministic and 0-1 probabilistic. We show that every…
In this article we describe how the celebrated result by Lions, Papanicolau and Varadhan on the Homogenization of Hamilton-Jacobi equation can be extended beyond the Euclidean setting. More specifically, we show how to obtain a…
We study feature selection for $k$-means clustering. Although the literature contains many methods with good empirical performance, algorithms with provable theoretical behavior have only recently been developed. Unfortunately, these…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…
The Hamiltonian treatment of constrained systems in $G\ddot{u}ler's$ formalism leads us to the total differential equations in many variables. These equations are integrable if the corresponding system of partial differential equations is a…
We propose a new identification system based on algorithmic problems related to computing isomorphisms between central simple algebras. We design a statistical zero knowledge protocol which relies on the hardness of computing isomorphisms…