English
Related papers

Related papers: Uniform Guarded Fragments

200 papers

In this paper we will explore the 2D system describing trapped ionic system in the quadrapole field with a superposition of rationally symmetric hexapole and octopole fields for meromorphic integrability. We use the Lyapunov's and…

Dynamical Systems · Mathematics 2021-03-31 Georgi Georgiev

Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive…

Logic in Computer Science · Computer Science 2007-08-14 Volker Weber

We investigate the computational complexity of mining guarded clauses from clausal datasets through the framework of inductive logic programming (ILP). We show that learning guarded clauses is NP-complete and thus one step below the…

Computational Complexity · Computer Science 2021-10-08 Andrei Draghici , Georg Gottlob , Matthias Lanzinger

We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd.…

Combinatorics · Mathematics 2022-07-01 Matthew Bowen , Gabor Kun , Marcin Sabok

In this article, we study deformations of conjugate self-dual Galois representations. The study has two folds. First, we prove an R=T type theorem for a conjugate self-dual Galois representation with coefficients in a finite field,…

Number Theory · Mathematics 2021-08-17 Yifeng Liu , Yichao Tian , Liang Xiao , Wei Zhang , Xinwen Zhu

In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming…

Computational Complexity · Computer Science 2017-08-15 Pooja Pandey , Abraham P. Punnen

We prove the No Invariant Line Fields conjecture for a class of generalized postcritically-finite branched covers on higher-dimensional Riemannian manifolds. Moreover, we establish a quasisymmetric uniformization theorem for this class of…

Dynamical Systems · Mathematics 2025-12-16 Zhiqiang Li , Pekka Pankka , Hanyun Zheng

We complete Maksimova's classification of the normal extensions of S4 with interpolation. In particular, we prove Craig interpolation for the six extensions of S4 for which Craig interpolation was still open. The proof strategy builds upon…

Logic · Mathematics 2026-04-27 Simon Santschi , Niels C. Vooijs

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

Logic in Computer Science · Computer Science 2025-09-11 Alessandro Artale , Christopher Hampson , Roman Kontchakov , Andrea Mazzullo , Frank Wolter

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field, and ${\Bbb S}$ a finite sequence of simple left $\Lambda$-modules. In [6, 9], quasiprojective algebraic varieties with accessible affine open covers were…

Representation Theory · Mathematics 2014-07-10 Klaus Bongartz , Birge Huisgen-Zimmermann

It is well known that the propositional modal logic $\mathbf{GL}$ of provability satisfies the de Jongh-Sambin fixed-point property. On the other hand, Montagna showed that the predicate modal system $\mathbf{QGL}$, which is the natural…

Logic · Mathematics 2019-11-25 Sohei Iwata , Taishi Kurahashi

An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…

Discrete Mathematics · Computer Science 2021-03-09 Matthieu Latapy , Thi Ha Duong Phan , Christophe Crespelle , Thanh Qui Nguyen

Using a relative trace formula approach, we prove the twisted global Gan-Gross-Prasad conjecture for $\operatorname{U}(V) \subseteq \operatorname{GL}(V)$, as well as its refinement, under some unramifiedness assumptions and local conditions…

Representation Theory · Mathematics 2024-12-06 Danielle Wang

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

Mathematical Physics · Physics 2017-11-22 Philippe Di Francesco

Necessary and sufficient conditions are obtained for the infinitesimal rigidity of braced grids in the plane with respect to non-Euclidean norms. Component rectangles of the grid may carry 0, 1 or 2 diagonal braces, and the combinatorial…

Metric Geometry · Mathematics 2020-09-24 Stephen Power

The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…

Logic in Computer Science · Computer Science 2017-03-06 Matthias Horbach , Marco Voigt , Christoph Weidenbach

For any unbranched double covering of compact Riemann surfaces, we study the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We introduce $k>0$…

Algebraic Geometry · Mathematics 2022-03-03 Cheng Shu

We derive the universal real time $U(1)$ topological gauge field action for mixed quantum states of weakly correlated fermions in all dimensions, and demonstrate its independence of the underlying equilibrium or non-equilibrium nature of…

Statistical Mechanics · Physics 2022-12-28 Ze-Min Huang , Xiao-Qi Sun , Sebastian Diehl

The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…

Logic · Mathematics 2025-10-06 Mikhail Rybakov

A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…

Combinatorics · Mathematics 2016-02-29 Aistis Atminas , Viktor Zamaraev
‹ Prev 1 8 9 10 Next ›