English
Related papers

Related papers: ACC for generalized log canonical thresholds for c…

200 papers

We prove that for some universal $c$, a non-collinear set of $N>\frac{1}{c}$ points in the Euclidean plane determines at least $c \frac{N}{\log N}$ distinct areas of triangles with one vertex at the origin, as well as at least $c…

Combinatorics · Mathematics 2016-02-09 Alex Iosevich , Oliver Roche-Newton , Misha Rudnev

In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.

Quantum Physics · Physics 2019-01-21 Federico Holik , Giuseppe Sergioli , Hector Freytes , Angelo Plastino

For a fixed pair and fixed exponents, we prove the discreteness of log discrepancies over all log canonical triples formed by attaching a product of ideals with given exponents.

Algebraic Geometry · Mathematics 2012-04-25 Masayuki Kawakita

Let X be a smooth variety over a field of positive characteristic, and let E be an overconvergent isocrystal on X. We establish a criterion for the existence of a "canonical logarithmic extension" of E to a good compactification of X. In…

Number Theory · Mathematics 2007-05-23 Kiran S. Kedlaya

We prove an upper bound on the log canonical threshold of a hypersurface that satisfies a certain power condition and use it to prove several generalizations of Igusa's conjecture on exponential sums, with the log-canonical threshold in the…

Number Theory · Mathematics 2019-03-20 Raf Cluckers , Mircea Mustaţǎ , Kien Huu Nguyen

The unification problem in algebras capable of describing sets has been tackled, directly or indirectly, by many researchers and it finds important applications in various research areas--e.g., deductive databases, theorem proving, static…

Logic in Computer Science · Computer Science 2007-05-23 Agostino Dovier , Enrico Pontelli , Gianfranco Rossi

We characterize the ideals $I$ of $\mathcal O_n$ of finite colength whose integral closure is equal to the integral closure of an ideal generated by pure monomials. This characterization, which is motivated by an inequality proven by…

Algebraic Geometry · Mathematics 2016-01-20 Carles Bivià-Ausina

For a nonempty compact subset $\sigma$ in the plane, the space $AC(\sigma)$ is the closure of the space of complex polynomials in two real variables under a particular variation norm. In the classical setting, $AC[0,1]$ contains several…

Functional Analysis · Mathematics 2022-11-09 Ian Doust , Michael Leinert , Alan Stoneham

We establish central limit theorems for an action of a group G on a hyperbolic space X with respect to the counting measure on a Cayley graph of G. Our techniques allow us to remove the usual assumptions of properness and smoothness of the…

Dynamical Systems · Mathematics 2020-04-29 Ilya Gekhtman , Samuel J. Taylor , Giulio Tiozzo

We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…

Logic · Mathematics 2021-02-23 Laurent De Rudder , Alessandra Palmigiano

This paper introduces the SEQ BIN meta-constraint with a polytime algorithm achieving general- ized arc-consistency according to some properties. SEQ BIN can be used for encoding counting con- straints such as CHANGE, SMOOTH or INCREAS- ING…

Artificial Intelligence · Computer Science 2011-10-24 Thierry Petit , Nicolas Beldiceanu , Xavier Lorca

We propose definitions of hypercomplex analytic spaces and hypercomplex schemes. We show that such a hypercomplex space is canonically associated to the quotient of a hypercomplex manifold by a finite group action.

Algebraic Geometry · Mathematics 2026-05-15 Roger Bielawski

We consider the models of distributed computation defined as subsets of the runs of the iterated immediate snapshot model. Given a task $T$ and a model $M$, we provide topological conditions for $T$ to be solvable in $M$. When applied to…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-05-21 Eli Gafni , Petr Kuznetsov , Ciprian Manolescu

In this article, we develop an algebraic framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. We further construct an explicit model and prove that it satisfies…

Quantum Physics · Physics 2022-08-23 Robert Lin

Let $F/F_0$ be a quadratic extension of totally real number fields, and let $E$ be an elliptic curve over $F$ which is isogenous to its Galois conjugate over $F_0$. A quadratic extension $M/F$ is said to be almost totally complex (ATC) if…

Number Theory · Mathematics 2012-04-17 Xavier Guitart , Victor Rotger , Yu Zhao

We propose a general transfer learning framework for clustering given a main dataset and an auxiliary one about the same subjects. The two datasets may reflect similar but different latent grouping structures of the subjects. We propose an…

Methodology · Statistics 2026-03-10 Yuqi Gu , Zhongyuan Lyu , Kaizheng Wang

This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…

Combinatorics · Mathematics 2019-03-22 Kohei Tanaka

We prove Koll\'ar's effective base point free theorem for log canonical pairs.

Algebraic Geometry · Mathematics 2009-07-13 Osamu Fujino

We investigate quantum group generalizations of various density results from Fourier analysis on compact groups. In particular, we establish the density of characters in the space of fixed points of the conjugation action on…

Operator Algebras · Mathematics 2019-08-15 Mahmood Alaghmandan , Jason Crann

This is a commentary on the CP 2003 paper "Efficient cnf encoding of boolean cardinality constraints". After recalling its context, we outline a classification of Constraints with respect to their deductive power regarding General Arc…

Artificial Intelligence · Computer Science 2020-06-04 Olivier Bailleux , Yacine Boufkhad