English
Related papers

Related papers: Minimal model program for normal pairs along log c…

200 papers

Motivated by the behavior of the trace pairing over tame cyclic number fields, we introduce the notion of tame lattices. Given an arbitrary non-trivial lattice $\mathcal{L}$ we construct a parametric family of full-rank sub-lattices…

Number Theory · Mathematics 2022-04-14 Mohamed Taoufiq Damir , Guillermo Mantilla-Soler

In this paper, we investigate how the initial models and the final models for the polynomial functors can be uniformly specified in matching logic.

Logic in Computer Science · Computer Science 2023-09-26 Dorel Lucanu

This paper presents a canonical dual approach for solving nonconvex quadratic minimization problem. By using the canonical duality theory, nonconvex primal minimization problems over n-dimensional Lorentz cone can be transformed into…

Optimization and Control · Mathematics 2012-10-22 Ning Ruan , David Yang Gao

A minimal representation of a simple non-compact Lie group is obtained by ``quantizing'' the minimal nilpotent coadjoint orbit of its Lie algebra. It provides context for Roger Howe's notion of a reductive dual pair encountered recently in…

Mathematical Physics · Physics 2014-11-21 Ivan Todorov

This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…

Optimization and Control · Mathematics 2018-01-29 Ning Ruan , David Yang Gao

Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…

Logic in Computer Science · Computer Science 2022-07-04 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki

Recent developments in regularized Canonical Correlation Analysis (CCA) promise powerful methods for high-dimensional, multiview data analysis. However, justifying the structural assumptions behind many popular approaches remains a…

Methodology · Statistics 2025-11-18 Lennie Wells , Kumar Thurimella , Sergio Bacallado

We prove the ACC for minimal log discrepancies on an arbitrary fixed threefold.

Algebraic Geometry · Mathematics 2024-12-05 Masayuki Kawakita

We present a short proof, relaying on the divergence theorem, verifying that minimal sets in the plane are trivial.

Classical Analysis and ODEs · Mathematics 2013-09-26 Ido Bright

We prove that the ACC conjecture for minimal log discrepancies holds for threefolds in $[1-\delta,+\infty)$, where $\delta>0$ only depends on the coefficient set. We also study Reid's general elephant for pairs, and show Shokurov's…

Algebraic Geometry · Mathematics 2022-02-16 Jingjun Han , Jihao Liu , Yujie Luo

We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…

Algebraic Geometry · Mathematics 2015-07-08 Grigory Rybnikov

A class of models intended to be as minimal and structureless as possible is introduced. Even in cases with simple rules, rich and complex behavior is found to emerge, and striking correspondences to some important core known features of…

Discrete Mathematics · Computer Science 2020-10-07 Stephen Wolfram

We develop a theory of motives with compact support for logarithmic schemes over a field. Starting from the notion of finite logarithmic correspondences with compact support, we define the logarithmic motive with compact support analogous…

Algebraic Geometry · Mathematics 2024-03-26 Nikolai Opdan

In this paper we prove the Zariski-Lipman conjecture for log canonical spaces.

Algebraic Geometry · Mathematics 2017-05-17 Stéphane Druel

In this paper, we formulate the Canonical Correlation Analysis (CCA) problem on matrix manifolds. This framework provides a natural way for dealing with matrix constraints and tools for building efficient algorithms even in an adaptive…

Machine Learning · Computer Science 2012-07-03 Florian Yger , Maxime Berar , Gilles Gasso , Alain Rakotomamonjy

In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group $G$, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided.…

Logic · Mathematics 2018-07-12 Waldemar W. Koczkodaj , Jean-Pierre Magnot

In this paper we present a minimal object oriented core calculus for modelling the biological notion of type that arises from biological ontologies in formalisms based on term rewriting. This calculus implements encapsulation, method…

Computational Engineering, Finance, and Science · Computer Science 2011-09-08 Livio Bioglio

We present a method for extracting general modules for ontologies formulated in the description logic ALC. A module for an ontology is an ideally substantially smaller ontology that preserves all entailments for a user-specified set of…

Artificial Intelligence · Computer Science 2023-05-17 Hui Yang , Patrick Koopmann , Yue Ma , Nicole Bidoit

We describe a technique for structured prediction, based on canonical correlation analysis. Our learning algorithm finds two projections for the input and the output spaces that aim at projecting a given input and its correct output into…

Computation and Language · Computer Science 2017-11-21 Nikos Papasarantopoulos , Helen Jiang , Shay B. Cohen

We first introduce a weak type of Zariski decomposition in higher dimensions: an $\R$-Cartier divisor has a weak Zariski decomposition if birationally and in a numerical sense it can be written as the sum of a nef and an effective…

Algebraic Geometry · Mathematics 2009-07-30 Caucher Birkar
‹ Prev 1 8 9 10 Next ›