English
Related papers

Related papers: On the Finiteness Problem for classes of modular l…

200 papers

We generalize the finiteness theorem for the locus of Hodge classes with fixed self-intersection number, due to Cattani, Deligne, and Kaplan, from Hodge classes to self-dual classes. The proof uses the definability of period mappings in the…

Algebraic Geometry · Mathematics 2026-05-06 Benjamin Bakker , Thomas W. Grimm , Christian Schnell , Jacob Tsimerman

As a step towards resolving a question of Ru\v{s}kuc on the decidability of joint embedding for hereditary classes of permutations, which may be viewed as structures in a language of 2 linear orders, we show the corresponding problem is…

Logic · Mathematics 2023-06-22 Samuel Braunfeld

Let us denote by LF the class of all orthomodular lattices (OMLs) that are locally finite (i.e., L in LF provided each finite subset of L generates in L a finite subOML). We first show in this note how one can obtain new locally finite OMLs…

Logic · Mathematics 2022-04-18 Dominika Burešová , Pavel Pták

We build convergent discretizations and semi-implicit solvers for the Infinity Laplacian and the game theoretical $p$-Laplacian. The discretizations simplify and generalize earlier ones. We prove convergence of the solution of the Wide…

Numerical Analysis · Mathematics 2012-12-06 Adam M. Oberman

It is shown that a finite monoid can have an infinite irredundant basis of equations.

Logic · Mathematics 2015-11-20 Marcel Jackson

For complete shrinking (gradient) Ricci solitons, we observe a quantification of Wylie's result that the fundamental group is finite.

Differential Geometry · Mathematics 2015-06-19 Bennett Chow , Peng Lu

We study the finitary satisfiability problem for first order logic with two variables and two binary relations, corresponding to the induced successor relations of two finite linear orders. We show that the problem is decidable in NEXPTIME.

Logic in Computer Science · Computer Science 2015-03-20 Diego Figueira

Using quantum representations of mapping class groups we prove that profinite completions of Burnside-type surface group quotients are not virtually prosolvable, in general. Further, we construct infinitely many finite simple characteristic…

Geometric Topology · Mathematics 2019-01-25 Louis Funar , Pierre Lochak

Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very "simple" modal logics can be undecidable: We show that there is…

Logic in Computer Science · Computer Science 2011-05-05 Edith Hemaspaandra , Henning Schnoor

We prove that up to scaling there are only finitely many integral lattices L of signature (2,n) with n>20 or n=17 such that the modular variety defined by the orthogonal group of L is not of general type. In particular, when n>107, every…

Algebraic Geometry · Mathematics 2018-07-04 Shouhei Ma

We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…

Group Theory · Mathematics 2013-03-25 O. Kharlampovich , A. Myasnikov , M. Sapir

We provide a new and simple proof based on Harnack's inequality to the Lipschitz continuity of the solutions of a class of free boundary problems.

Analysis of PDEs · Mathematics 2019-09-09 Abdeslem Lyaghfouri

We study the satisfiability problem for the fluted fragment extended with transitive relations. The logic enjoys the finite model property when only one transitive relation is available and the finite model property is lost when…

Logic in Computer Science · Computer Science 2024-05-22 Ian Pratt-Hartmann , Lidia Tendera

We consider the problem of determining, given x, y in Z^k and a finite set F of affine functions on Z^k, whether y is reachable from x by applying the functions F. We also consider the analogous problem over N^k. These problems are known to…

Formal Languages and Automata Theory · Computer Science 2013-04-10 Daniel Fremont

We obtain existence results for a class of fully nonlinear Yamabe-type problems on non-compact manifolds, addressing both the so-called positive and negative cases. We also give explicit examples of manifolds with warped product ends and…

Analysis of PDEs · Mathematics 2024-01-17 Jonah A. J. Duncan , Yi Wang

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

Logic in Computer Science · Computer Science 2025-07-16 Philippe Balbiani , Olivier Gasquet

We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.

Group Theory · Mathematics 2021-07-30 Nikolay Nikolov , Dan Segal

Given a finite dimensional algebra $\Lambda$, we show that a frequently satisfied finiteness condition for the category ${\cal P}^{\infty}(\Lambda\rm{-mod})$ of all finitely generated (left) $\Lambda$-modules of finite projective dimension,…

Representation Theory · Mathematics 2014-07-10 B. Huisgen-Zimmermann , S. O. Smalø

Fix a smooth projective curve over a field of characteristic zero and a finite set of punctures. Let G be a connected linear algebraic group. We prove that the moduli of G-bundles with logarithmic connections having fixed residue classes at…

Algebraic Geometry · Mathematics 2023-01-20 Andres Fernandez Herrero
‹ Prev 1 8 9 10 Next ›