English
Related papers

Related papers: Isomorphism property in nonstandard extensions of …

200 papers

A famous result due to Lov\'{a}sz states that two finite relational structures $M$ and $N$ are isomorphic if, and only if, for all finite relational structures $T$, the number of homomorphisms from $T$ to $M$ is equal to the number of…

Logic in Computer Science · Computer Science 2025-07-01 Jesse Comer

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

Logic · Mathematics 2018-05-14 Samuel Braunfeld

Let $R$ be a standard graded polynomial ring that is finitely generated over a field, and let $I$ be a homogenous prime ideal of $R$. Bhatt, Blickle, Lyubeznik, Singh, and Zhang examined the local cohomology of $R/I^t$, as $t$ grows…

Commutative Algebra · Mathematics 2020-05-26 Jennifer Kenkel

Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…

Mathematical Physics · Physics 2015-10-14 Rencai Lu , Kaiming Zhao

It is well known [Lov\'asz, 67] that up to isomorphism a graph~$G$ is determined by the homomorphism counts $\hom(F, G)$, i.e., the number of homomorphisms from $F$ to $G$, where $F$ ranges over all graphs. Thus, in principle, we can answer…

Computational Complexity · Computer Science 2023-04-21 Yijia Chen , Jörg Flum , Mingjun Liu , Zhiyang Xun

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

Group Theory · Mathematics 2015-01-23 Mark L. Lewis , James B. Wilson

It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…

Logic · Mathematics 2022-08-30 Tapani Hyttinen , Jouko Väänänen

In this paper, we characterize infinite-dimensional manifolds modeled on absorbing sets in non-separable Hilbert spaces by using the discrete cells property, which is a general position property. Moreover, we study the discrete (locally…

General Topology · Mathematics 2019-03-18 Katsuhisa Koshino

Unitarity is a cornerstone of quantum theory, ensuring the conservation of probability and information. Although non-Hermitian Hamiltonians are typically associated with open or dissipative systems, pseudo-Hermitian quantum mechanics shows…

High Energy Physics - Theory · Physics 2025-11-03 Ruifeng Leng , Cheng-Yang Lee , Siyi Zhou

A symmetric ideal is an ideal in a polynomial ring which is stable under all permutations of the variables. In this paper we initiate a global study of zero-dimensional symmetric ideals. By this we mean a geometric study of the invariant…

Algebraic Geometry · Mathematics 2025-09-15 Sebastian Debus , Andreas Kretschmer

We derive necessary and sufficient conditions for all global symmetries of the most general two Higgs doublet model (2HDM) scalar potential entirely in terms of reparametrization independent, i.e. basis invariant, objects. This culminates…

High Energy Physics - Phenomenology · Physics 2021-03-02 Miguel P. Bento , Rafael Boto , João P. Silva , Andreas Trautner

We study Hopf algebras via tools from geometric invariant theory. We show that all the invariants we get can be constructed using the integrals of the Hopf algebra and its dual together with the multiplication and the comultiplication, and…

Quantum Algebra · Mathematics 2016-02-26 Ehud Meir

Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order.…

Logic in Computer Science · Computer Science 2017-03-08 Katsuhiko Sano , John G. Stell

We study expansions of Hilbert spaces with a bounded normal operator $T$. We axiomatize this theory in a natural language and identify all of its completions. We prove the definability of the adjoint $T^*$ and prove quantifier elimination…

Logic · Mathematics 2025-07-30 Alexander Berenstein , Nicolás Cuervo Ovalle , Isaac Goldbring

Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and a set Q of primes. The intuition is that two graphs G and H which are equivalent…

Logic in Computer Science · Computer Science 2019-08-28 Anuj Dawar , Erich Grädel , Wied Pakusa

We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…

Functional Analysis · Mathematics 2018-10-15 Masatoshi Enomoto , Yasuo Watatani

For a fixed graph $H$ and for arbitrarily large host graphs $G$, the number of homomorphisms from $H$ to $G$ and the number of subgraphs isomorphic to $H$ contained in $G$ have been extensively studied in extremal graph theory and graph…

Combinatorics · Mathematics 2021-07-05 Chun-Hung Liu

Homotopy type theory (HoTT) can be seen as a generalisation of structural set theory, in the sense that 0-types represent structural sets within the more general notion of types. For material set theory, we also have concrete models as…

Logic · Mathematics 2025-10-31 Håkon Robbestad Gylterud , Elisabeth Stenholm

We investigate the problem of type isomorphisms in the presence of higher-order references. We first introduce a finitary programming language with sum types and higher-order references, for which we build a fully abstract games model…

Logic in Computer Science · Computer Science 2015-07-01 Pierre Clairambault

We consider a two-parameter family of random substitutions and show certain combinatorial and topological properties they satisfy. We establish that they admit recognisable words at every level. As a consequence, we get that the subshifts…

Dynamical Systems · Mathematics 2021-08-13 Giovanni B. Escolano , Neil Mañibo , Eden Delight Miro
‹ Prev 1 4 5 6 7 8 10 Next ›