English
Related papers

Related papers: Modeling the Dialectic

200 papers

In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…

Logic · Mathematics 2025-10-03 Łukasz Kamiński

We study the rational dynamics of the map $\mathcal{T}(x)=\lfloor x\rfloor(1+\{x\})$, which appears in the recursive construction of the prime-representing constant of Fridman, Garbulsky, Glecer, Grime and Florentin. For a rational number…

Number Theory · Mathematics 2026-05-22 André Carvalho

In this paper we study the number of special directions of sets of cardinality divisible by $p$ on a finite plane of characteristic $p$, where $p$ is a prime. We show that there is no such a set with exactly two special directions. We…

Combinatorics · Mathematics 2023-02-28 Gergely Kiss , Gábor Somlai

We present distributions of countable models and correspondent structural characteristics of complete theories with continuum many types: for prime models over finite sets relative to Rudin-Keisler preorders, for limit models over types and…

Logic · Mathematics 2012-10-16 Roman A. Popkov , Sergey V. Sudoplatov

The normal form for a system of ode's is constructed from its polynomial symmetries of the linear part of the system, which is assumed to be semi-simple. The symmetries are shown to have a simple structure such as invariant function times…

patt-sol · Physics 2009-10-28 Yuji Kodama

All finite dimensional Nichols algebras with diagonal type of connected finite dimensional Yetter-Drinfeld modules over finite cyclic group $\mathbb Z_n$ are found. It is proved that finite dimensional Nichols algebra over $\mathbb Z_2$ is…

Number Theory · Mathematics 2013-10-10 Weicai Wu , Shouchuan Zhang , Yao-Zhong Zhang

A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite.…

Combinatorics · Mathematics 2024-02-22 Frédéric Havet , Florian Hörsch , Lucas Picasarri-Arrieta

In this paper, we construct an infinite series of line arrangements in characteristic two, each featuring only triple intersection points. This finding challenges the existing conjecture that suggests the existence of only a finite number…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne , Tomasz Szemberg , Halszka Tutaj-Gasińska

Eick & Leedham-Green sketched a construction for infinite sequences of finite $p$-groups with fixed coclass. These infinite sequences have turned out to be very useful in the theory of finite $p$-groups. We exhibit a detailed description…

Group Theory · Mathematics 2010-07-27 Bettina Eick , Dörte Feichtenschlager

We demonstrate that the number of cycles for two problems of the family of generalized 3x+1 mappings is possible finite.

Number Theory · Mathematics 2021-11-12 Robert Tremblay

A finite volume scheme for the (Patlak-) Keller-Segel model in two space dimensions with an additional cross-diffusion term in the elliptic equation for the chemical signal is analyzed. The main feature of the model is that there exists a…

Numerical Analysis · Mathematics 2012-08-02 Marianne Bessemoulin-Chatard , Ansgar Jüngel

In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…

Combinatorics · Mathematics 2025-05-15 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

Logic in Computer Science · Computer Science 2021-07-06 Bharat Adsul , Saptarshi Sarkar , A. V. Sreejith

We construct a singular homology theory on the category of schemes of finite type over a Dedekind domain and verify several basic properties. For arithmetic schemes we construct a reciprocity isomorphism between the integral singular…

Number Theory · Mathematics 2007-07-30 Alexander Schmidt

It is shown that a finite group in which more than 3/4 of the elements are involutions must be an elementary abelian 2-group. A group in which exactly 3/4 of the elements are involutions is characterized as the direct product of the…

Group Theory · Mathematics 2009-11-09 Allan L. Edmonds , Zachary B. Norwood

A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural…

Algebraic Geometry · Mathematics 2024-12-17 Thibault Poiret , Dhruv Ranganathan

New variational formulations are devised for the curl--div system, and the corresponding finite element approximations are shown to converge. Curl--free and divergence--free finite elements are employed for discretizing the problem.

Numerical Analysis · Mathematics 2015-12-31 Ana Alonso Rodríguez , Enrico Bertolazzi , Alberto Valli

We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…

Group Theory · Mathematics 2015-01-08 Martin R. Bridson

In this paper we firstly review how to \textit{explicitly} solve a system of $3$ \textit{first-order linear recursions }and outline the main properties of these solutions. Next, via a change of variables, we identify a class of systems of…

Exactly Solvable and Integrable Systems · Physics 2024-09-10 Francesco Calogero

We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the equivalence of four notions of representability of rational streams:…

Logic in Computer Science · Computer Science 2015-07-01 J. J. M. M. Rutten
‹ Prev 1 8 9 10 Next ›