English
Related papers

Related papers: Second order conservative languages with a Maltsev…

200 papers

The goal of the article is to characterize the conservative homeomorphisms of a closed orientable surface $S$ of genus $\geq 2$, that have finitely many periodic points. By conservative, we mean a map with no wandering point. As a…

Dynamical Systems · Mathematics 2020-08-04 Patrice Le Calvez

The class of known constraint automata for which the constrained synchronization problem is in NP all admit a special form. In this work, we take a closer look at them. We characterize a wider class of constraint automata that give…

Formal Languages and Automata Theory · Computer Science 2021-08-24 Stefan Hoffmann

Contemporary deep learning models effectively handle languages with diverse morphology despite not being directly integrated into them. Morphology and word order are closely linked, with the latter incorporated into transformer-based models…

Computation and Language · Computer Science 2024-05-31 Poulami Ghosh , Shikhar Vashishth , Raj Dabre , Pushpak Bhattacharyya

Most natural languages have a predominant or fixed word order. For example in English the word order is usually Subject-Verb-Object. This work attempts to explain this phenomenon as well as other typological findings regarding word order…

Computation and Language · Computer Science 2021-09-02 Idan Rejwan , Avi Caciularu

The concepts used in IFOL have associated to them a list of sorted attributes, and the sorts are the intensional concepts as well. The requirement to extend the unsorted IFOL (Intensional FOL) to many-sorted IFOL is mainly based on the fact…

Artificial Intelligence · Computer Science 2024-09-10 Zoran Majkic

The classifications of temporal and phylogeny constraint languages stand among the most seminal complexity classifications within infinite-domain Constraint Satisfaction Problems (CSPs), yet remain the most mysterious in terms of algorithms…

Logic in Computer Science · Computer Science 2026-05-07 Johanna Brunar , Michael Pinsker , Moritz Schöbi

We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then…

Discrete Mathematics · Computer Science 2014-07-15 Gabriele Fici , Luca Q. Zamboni

We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…

Logic · Mathematics 2012-08-28 Tapani Hyttinen , Kaisa Kangas , Jouko Väänänen

This article provides a reminder of some properties of primitive words and the morphisms that preserve them. Their proofs, which I have more or less revised, are included. This makes the article almost self-contained. I also contribute by…

Formal Languages and Automata Theory · Computer Science 2026-01-28 Francis Wlazinski

It is established a continuous boundary extension of some class of mappings. Under some additional conditions, we have established that this extension is light in the closure of the definition domain. Under some stronger conditions, we also…

Complex Variables · Mathematics 2022-11-08 Evgeny Sevost'yanov

Given a dynamical system, a characteristic measure is a Borel probability measure invariant under all of its automorphisms. Frisch and Tamuz asked if every symbolic system supports such a measure. Motivated by this problem, we study the…

Dynamical Systems · Mathematics 2026-02-05 Solly Coles , Van Cyr , Bryna Kra , Ronnie Pavlov

Recent research argues that exact recursive numeral systems optimize communicative efficiency by balancing a tradeoff between the size of the numeral lexicon and the average morphosyntactic complexity (roughly length in morphemes) of…

n this paper, we attempt to explain the emergence of the linguistic diversity that exists across the consonant inventories of some of the major language families of the world through a complex network based growth model. There is only a…

Computation and Language · Computer Science 2009-04-09 Monojit Choudhury , Animesh Mukherjee , Anupam Basu , Niloy Ganguly , Ashish Garg , Vaibhav Jalan

We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fixed set of cost functions over a finite domain. An instance of the problem is specified by…

Computational Complexity · Computer Science 2010-08-25 Vladimir Kolmogorov

Vaught's Conjecture states that if $T$ is a complete first order theory in a countable language that has more than $\aleph_0$ pairwise non-isomorphic countably infinite models, then $T$ has $2^{\aleph_0}$ such models. Morley showed that if…

Logic · Mathematics 2018-11-21 M. Assem , T. S. Ahmed , G. Sági , D. Sziráki

Given a fixed constraint language $\Gamma$, the conservative CSP over $\Gamma$ (denoted by c-CSP($\Gamma$)) is a variant of CSP($\Gamma$) where the domain of each variable can be restricted arbitrarily. A dichotomy is known for conservative…

Computational Complexity · Computer Science 2016-06-21 Clément Carbonnel

In this paper we introduce a notion of Mal'tsev object, and the dual notion of co-Mal'tsev object, in a general category. In particular, a category $\mathbb{C}$ is a Mal'tsev category if and only if every object in $\mathbb{C}$ is a…

Category Theory · Mathematics 2019-11-05 Thomas Weighill

A way to obtain a correspondence between the first order and second order formalism is studied. By introducing a Lagrange multiplier coupled to the covariant derivative of the metric, a metricity constraint is implemented. The new…

General Relativity and Quantum Cosmology · Physics 2018-08-22 David Benisty , Eduardo I. Guendelman

A two-dimensional ($2$D) word is a $2$D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are $1$D palindromes. We study some combinatorial and structural properties of HV-palindromes and its…

Discrete Mathematics · Computer Science 2019-09-18 Kalpana Mahalingam , Palak Pandoh

We solve some problems about relative lengths of Maltsev conditions, in particular, we give an affirmative answer to a classical problem raised by A. Day more than fifty years ago. In detail, both congruence distributive and congruence…

Rings and Algebras · Mathematics 2024-05-28 Paolo Lipparini
‹ Prev 1 4 5 6 7 8 10 Next ›