English
Related papers

Related papers: Binary intersection formalized

200 papers

We prove that for any coloring of the naturals using two colors there are monochromatic sets of the form $\{x,y,xy,x+iy:i\leq k\}$ and $\{x,y,x^y,xy^i:i\leq k\}$ for any $k$.

Combinatorics · Mathematics 2025-12-11 Ryan Alweiss , Matthew Bowen , Marcin Sabok

We study the state complexity of boolean operations, concatenation and star with one or two of the argument languages reversed. We derive tight upper bounds for the symmetric differences and differences of such languages. We prove that the…

Formal Languages and Automata Theory · Computer Science 2012-07-04 Janusz Brzozowski , David Liu

We present a complete formalization in Isabelle/HOL of the object part of an equivalence between L-mosaics and bounded join-semilattices, employing an AI-assisted methodology that integrates large language models as reasoning assistants…

Logic in Computer Science · Computer Science 2025-09-25 Alessandro Linzi

Let $P=\mathbb P^m(e)\times\mathbb P^n(h)$ be a product of weighted projective spaces, and let $\Delta_P$ be the diagonal of $P\times P$. We prove an algebraization result for formal-rational functions on certain closed subvarieties $X$ of…

Algebraic Geometry · Mathematics 2014-03-13 Lucian Badescu

This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in the dissertation is combinatorial complexity, which is a…

Formal Languages and Automata Theory · Computer Science 2010-10-27 Arseny M. Shur

This paper shows that generalizations of operads equipped with their respective bar/cobar dualities are related by a six operations formalism analogous to that of classical contexts in algebraic geometry. As a consequence of our…

Algebraic Topology · Mathematics 2019-03-29 Benjamin C. Ward

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

We investigate the intersection problem for finite monoids, which asks for a given set of regular languages, represented by recognizing morphisms to finite monoids from a variety V, whether there exists a word contained in their…

Formal Languages and Automata Theory · Computer Science 2018-02-05 Lukas Fleischer , Manfred Kufleitner

Two classes of methods have been shown to be useful for resolving lexical ambiguity. The first relies on the presence of particular words within some distance of the ambiguous target word; the second uses the pattern of words and…

cmp-lg · Computer Science 2008-02-03 Andrew R. Golding

Let H:(M,p)->(M',p') be a formal mapping between two germs of real-analytic generic submanifolds in C^N with nonvanishing Jacobian. Assuming M to be minimal at p and M' holomorphically nondegenerate at p', we prove the convergence of the…

Complex Variables · Mathematics 2010-02-12 Jean-Charles Sunyé

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

We study the strict type assignment for lambda-mu that is presented in [van Bakel'16]. We define a notion of approximants of lambda-mu-terms, show that it generates a semantics, and that for each typeable term there is an approximant that…

Logic in Computer Science · Computer Science 2017-02-09 Steffen van Bakel

We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…

Logic · Mathematics 2022-03-23 David Fernández-Duque

Words can be represented by composing the representations of subword units such as word segments, characters, and/or character n-grams. While such representations are effective and may capture the morphological regularities of words, they…

Computation and Language · Computer Science 2017-04-28 Clara Vania , Adam Lopez

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

Using random variables as motivation, this paper presents an exposition of the formalisms developed by Rota and Taylor for the classical umbral calculus. A variety of examples are presented, culminating in several descriptions of sequences…

Combinatorics · Mathematics 2007-05-23 Brian D. Taylor

We prove several new transversality results for formal CR maps between formal real hypersurfaces in complex space. Both cases of finite and infinite type hypersurfaces are tackled in this note.

Complex Variables · Mathematics 2015-06-26 Bernhard Lamel , Nordine Mir

We consider the problem of inverting the transformation which consists in replacing a word by the sequence of its blocks of length N, i.e. its so-called N-block presentation. It was previously shown that among all the possible preimages of…

Combinatorics · Mathematics 2016-04-07 Emilie Delnieppe

We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.

Combinatorics · Mathematics 2012-01-19 Klaus Dohmen

We consider Hilsum's notion of bordism as an equivalence relation on unbounded $KK$-cycles and study the equivalence classes. Upon fixing two $C^*$-algebras, and a $*$-subalgebra dense in the first $C^*$-algebra, a…

K-Theory and Homology · Mathematics 2018-07-31 Robin J. Deeley , Magnus Goffeng , Bram Mesland