English
Related papers

Related papers: On the complexity of solving linear congruences an…

200 papers

We study the model checking problem, for fixed structures A, over positive equality-free first-order logic -- a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(A). We prove a complete complexity…

Computational Complexity · Computer Science 2008-08-06 Barnaby Martin

Motivated by classical facts concerning closed manifolds, we introduce a strong finiteness property in K-homology. We say that a C*-algebra has uniformly summable K-homology if all its K-homology classes can be represented by Fredholm…

Operator Algebras · Mathematics 2015-12-16 Heath Emerson , Bogdan Nica

Let M_d(k) denote the space of dxd-matrices with coefficients in an algebraically closed field k. Let X be an orbit closure in the product [M_d(k)]^t equipped with the action of the general linear group GL_d(k) by simultaneous conjugation.…

Algebraic Geometry · Mathematics 2007-05-23 Grzegorz Zwara

We introduce the class of \emph{Log-Noetherian} (LN) functions. These are holomorphic solutions to algebraic differential equations (in several variables) with logarithmic singularities. We prove an upper bound on the number of solutions…

Algebraic Geometry · Mathematics 2024-05-28 Gal Binyamini

We present a framework for constructing congruence closure modulo permutation equations, which extends the abstract congruence closure framework for handling permutation function symbols. Our framework also handles certain interpreted…

Logic in Computer Science · Computer Science 2021-09-09 Dohan Kim , Christopher Lynch

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

Number Theory · Mathematics 2016-10-25 Chatchawan Panraksa , Pornrat Ruengrot

In the classical linear degeneracy testing problem, we are given $n$ real numbers and a $k$-variate linear polynomial $F$, for some constant $k$, and have to determine whether there exist $k$ numbers $a_1,\ldots,a_k$ from the set such that…

Computational Geometry · Computer Science 2022-12-07 Jean Cardinal , Micha Sharir

We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*\in\mathbb{R}^{m\times n}$. Algorithmically, the robust matrix…

Machine Learning · Statistics 2020-03-25 Yunfeng Cai , Ping Li

An uniform LP duality is an useful property of conic matrix systems. A consistent linear conic optimization problem yields uniform LP duality if for any linear cost function, for which the primal problem has finite optimal value, the…

Optimization and Control · Mathematics 2023-02-21 Kostyukova O. I. , Tchemisova T. , Dudina O. S

Let L be a second order, uniformly elliptic operator, and consider the equation L u=f under the homogeneous boundary condition u=0. It is well known that f in C(Om) (Om= Omega) does not guarantee second order derivatives D^2 u in C(Om).…

Analysis of PDEs · Mathematics 2015-10-19 Hugo Beirao da Veiga

Thus far in the search for, and classification of, `physical' modular invariant partition functions $\sum N_{LR}\,\c_L\,\C_R$ the attention has been focused on the {\it symmetric} case where the holomorphic and anti-holomorphic sectors, and…

High Energy Physics - Theory · Physics 2009-10-22 Terry Gannon

The first part of this work uses the algorithm recently detailed in arXiv:1906.02935 to classify the irreducible weight modules of the minimal model vertex operator algebra $L_k(\mathfrak{sl}_3)$, when the level $k$ is admissible. These are…

Quantum Algebra · Mathematics 2022-10-19 Kazuya Kawasetsu , David Ridout , Simon Wood

We address here the question of whether the characters of an RCFT are modular functions for some level N, i.e. whether the representation of the modular group SL_2(Z) coming from any RCFT is trivial on some congruence subgroup. We prove…

Quantum Algebra · Mathematics 2007-05-23 A. Coste , T. Gannon

Let K be a number field with ring of integers O, and let G be a finite-index subgroup of SL(n,O). Using a classical construction from the geometry of numbers and the theory of modular symbols, we exhibit a finite spanning set for the…

Number Theory · Mathematics 2007-05-23 Paul E. Gunnells

In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…

Combinatorics · Mathematics 2023-09-07 Flavien Mabilat

We compute the monoid $V(L_K(E))$ of isomorphism classes of finitely generated projective modules over certain graph algebras $L_K(E)$, and we show that this monoid satisfies the refinement property and separative cancellation. We also show…

Rings and Algebras · Mathematics 2007-05-23 P. Ara , M. A. Moreno , E. Pardo

In this paper the authors investigate infinite-dimensional representations $L$ in blocks of the relative (parabolic) category ${\mathcal O}_S$ for a complex simple Lie algebra, having the property that the cohomology of the nilradical with…

Representation Theory · Mathematics 2007-05-23 Brian D. Boe , Markus Hunziker

The identification of relevant collective coordinates is crucial for the interpretation of coherent nonlinear spectroscopies of complex molecules and liquids. Using an $\hbar$ expansion of Liouville space generating functions, we show how…

Materials Science · Physics 2007-05-23 Thomas la Cour Jansen , Shaul Mukamel

Let G be a finite group of Lie type, defined over a field k of characteristic p > 0. We find explicit bounds for the dimension of the first cohomology group for G with coefficients in a simple kG-module. We proceed by bounding the number of…

Representation Theory · Mathematics 2017-05-17 Alison E. Parker , David I. Stewart

The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…

Logic in Computer Science · Computer Science 2024-04-30 Hugo Férée , Iris van der Giessen , Sam van Gool , Ian Shillito
‹ Prev 1 3 4 5 6 7 10 Next ›