English
Related papers

Related papers: Detecting Zariski Pairs by Algorithms and Computat…

200 papers

The Zariski quantization is one of the strong candidates for a quantization of the Nambu-Poisson bracket. In this paper, we apply the Zariski quantization for first quantized field theories, such as superstring and supermembrane theories,…

High Energy Physics - Theory · Physics 2013-04-17 Matsuo Sato

We determine several classes of smooth complex projective surfaces on which Zariski decomposition can be combined with vanishing theorems to yield cohomology formulae for all line bundles. The obtained formulae express cohomologies in terms…

High Energy Physics - Theory · Physics 2020-09-04 Callum R. Brodie , Andrei Constantin

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

Combinatorics · Mathematics 2014-03-04 Zipei Nie , Anthony Y. Wang

In arXiv:2511.04191 we constructed schemes of objects in small categories which contained a set of basepoints with local representing (localizing) objects. Here we prove that the category $\cat{Rings}$ of associative rings with unit has a…

Algebraic Geometry · Mathematics 2025-11-12 Arvid Siqveland

Empirical properties of generating systems for complex reflection groups and their braid groups have been observed by Orlik-Solomon and Brou\'e-Malle-Rouquier, using Shephard-Todd classification. We give a general existence result for…

Group Theory · Mathematics 2009-10-31 David Bessis

A novel algorithm, called semantic line combination detector (SLCD), to find an optimal combination of semantic lines is proposed in this paper. It processes all lines in each line combination at once to assess the overall harmony of the…

Computer Vision and Pattern Recognition · Computer Science 2024-05-02 Jinwon Ko , Dongkwon Jin , Chang-Su Kim

Linear systems are the bedrock of virtually all numerical computation. Machine learning poses specific challenges for the solution of such systems due to their scale, characteristic structure, stochasticity and the central role of…

Machine Learning · Computer Science 2020-10-26 Jonathan Wenger , Philipp Hennig

Markov networks are widely studied and used throughout multivariate statistics and computer science. In particular, the problem of learning the structure of Markov networks from data without invoking chordality assumptions in order to…

Machine Learning · Statistics 2025-12-29 Juri Kuronen , Jukka Corander , Johan Pensar

We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…

Complex Variables · Mathematics 2024-09-20 Vahagn Aslanyan

We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…

Algebraic Geometry · Mathematics 2018-05-04 E. Artal , J. Carmona , J. I. Cogolludo , M. Marco

Pairing symmetry is important to indentify the pairing mechanism. The analysis becomes particularly timely and important for the newly discovered iron-based multi-orbital superconductors. From group theory point of view we classified all…

Superconductivity · Physics 2009-11-13 Yuan Wan , Qiang-Hua Wang

Error-correcting pairs were introduced independently by Pellikaan and K\"otter as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known…

Information Theory · Computer Science 2015-12-29 Umberto Martínez-Peñas , Ruud Pellikaan

A family C of circuits of a matroid M is a linear class if, given a modular pair of circuits in C}, any circuit contained in the union of the pair is also in C. The pair (M,C) can be seen as a matroidal generalization of a biased graph. We…

Combinatorics · Mathematics 2007-05-23 Raul Cordovil , David Forge

Local markers provide an efficient and powerful characterization of topological features of many systems, especially when the translation symmetry is broken. Recently, a universal topological local marker applicable in different symmetry…

Other Condensed Matter · Physics 2026-01-01 Yulin Qin , Chang-An Li , Jian Li

We study, for plane complex branches of genus one, the topological type of its generic polar curve, as a function of the semigroup of values and the Zariski invariant of the branch. We improve some results given by Casas-Alvero in 2023,…

Algebraic Geometry · Mathematics 2024-11-19 Evelia R. García Barroso , Marcelo E. Hernandes , M. Fernando Hernández Iglesias

We present an improved algorithm for the computation of Zariski chambers on algebraic surfaces. The new algorithm significantly outperforms the so far available method and allows therefore to treat surfaces of high Picard number, where huge…

Algebraic Geometry · Mathematics 2019-02-20 Thomas Bauer , David Schmitz

Zamolodchikov periodicity is a property of certain discrete dynamical systems and was one of the primary motivations for the creation of cluster algebras. It was first observed by Zamolodchikov in his study of thermodynamic Bethe ansatz,…

Combinatorics · Mathematics 2025-12-19 Ariana Chin

In a basic framework of a complex Hilbert space equipped with a complex conjugation and an involution, linear operators can be real, quaternionic, symmetric or anti-symmetric, and orthogonal projections can furthermore be symplectic. This…

Mathematical Physics · Physics 2016-10-27 Julian Grossmann , Hermann Schulz-Baldes

In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…

Machine Learning · Computer Science 2012-07-03 Franz Kiraly , Ryota Tomioka

We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…

Commutative Algebra · Mathematics 2018-06-21 Sebastian Posur