English
Related papers

Related papers: A rank function for Fra\"{\i}ss\'{e} classes and t…

200 papers

Functional tensor decomposition can analyze multi-dimensional data with real-valued indices, paving the path for applications in machine learning and signal processing. A limitation of existing approaches is the assumption that the tensor…

Machine Learning · Computer Science 2025-12-29 Siyuan Li , Shikai Fang , Lei Cheng , Feng Yin , Yik-Chung Wu , Peter Gerstoft , Sergios Theodoridis

We study several structure aspects of functor categories from a small additive category to a module category, in particular the category F(A,K) of functors from finitely generated free modules over a commutative ring A to vector spaces over…

Category Theory · Mathematics 2024-12-23 Aurélien Djament , Antoine Touzé

In mathematical modeling, it is common to have an equation $F(p)=c$ where the exact form of $F$ is not known. This article shows that there are large classes of $F$ where almost all $F$ share the same properties. The classes we investigate…

Classical Analysis and ODEs · Mathematics 2022-03-10 Sana Jahedi , Timothy Sauer , James A. Yorke

We study the coset covering function $\mathfrak{C}(r)$ of a finitely generated group: the number of cosets of infinite index subgroups needed to cover the ball of radius $r$. We show that $\mathfrak{C}(r)$ is of order at least $\sqrt{r}$…

Group Theory · Mathematics 2024-05-01 Elia Gorokhovsky , Nicolás Matte Bon , Omer Tamuz

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…

Combinatorics · Mathematics 2025-01-16 Iian B. Smythe , Mithuna Threz , Max Wiebe

Let Rep(F;K) denote the category of functors from finite dimensional F-vector spaces to K-modules, where F is a field and K is a commutative ring. We prove that, if F is a finite field, and Char F is invertible in K, then the K-linear…

Representation Theory · Mathematics 2014-05-08 Nicholas J. Kuhn

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

We introduce a method for proving almost sure termination in the context of lambda calculus with continuous random sampling and explicit recursion, based on ranking supermartingales. This result is extended in three ways. Antitone ranking…

Programming Languages · Computer Science 2021-05-04 Andrew Kenyon-Roberts , Luke Ong

A subset $A$ of a topological space $X$ is called relatively functionally countable (RFC) in $X$, if for each continuous function $f : X \to \mathbb{R}$ the set $f[A]$ is countable. We prove that all RFC subsets of a product…

General Topology · Mathematics 2024-11-11 Anton Lipin

Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…

Logic · Mathematics 2010-08-17 Daniel J. Miller

We introduce a new class $\mathcal{FV}(\Omega,E)$ of spaces of weighted functions on a set $\Omega$ with values in a locally convex Hausdorff space $E$ which covers many classical spaces of vector-valued functions like continuous, smooth,…

Functional Analysis · Mathematics 2021-04-08 Karsten Kruse

It is a classical theorem that the free product of ordered groups is orderable. In this note we show that, using a method of G. Bergman, an ordering of the free product can be constructed in a functorial manner, in the category of ordered…

Group Theory · Mathematics 2018-03-16 Dale Rolfsen

Classical versions of Kolmogorov complexity are incomputable. Nevertheless, in 1975 Solovay showed that there are computable functions $f > K+O(1)$ such that for infinitely many strings $\sigma$, $f(\sigma)=K(\sigma)+O(1)$, where $K$…

Logic · Mathematics 2016-03-29 Laurent Bienvenu , Rod Downey , Wolfgang Merkle , André Nies

Given a finite alphabet $\Sigma$ and a right-infinite word $w$ over the alphabet $\Sigma$, we construct a topological space ${\rm Rec}(w)$ consisting of all right-infinite recurrent words whose factors are all factors of $w$, where we work…

Formal Languages and Automata Theory · Computer Science 2022-05-12 Jason Bell

The profile of a relational structure $R$ is the function $\varphi_R$ which counts for every integer $n$ the number $\varphi_R(n)$, possibly infinite, of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures…

Combinatorics · Mathematics 2014-02-14 Maurice Pouzet , Nicolas M. Thiéry

In this paper we derive the maximum entropy characteristics of a particular rank order distribution, namely the discrete generalized beta distribution, which has recently been observed to be extremely useful in modelling many several…

Physics and Society · Physics 2019-09-30 Abhik Ghosh , Preety Shreya , Banasri Basu

Let $\Omega$ be an algebraic closure of ${\mathbb Q}_p$ and let $F$ be a finite extension of ${\mathbb Q}_p$ contained in $\Omega$. Given positive integers $f$ and $e$, the number of extensions $K/F$ contained in $\Omega$ with residue…

Number Theory · Mathematics 2007-05-23 Xiang-dong Hou , Kevin Keating

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

Combinatorics · Mathematics 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

We introduce the monic rank of a vector relative to an affine-hyperplane section of an irreducible Zariski-closed affine cone $X$. We show that the monic rank is finite and greater than or equal to the usual $X$-rank. We describe an…

Algebraic Geometry · Mathematics 2020-06-15 Arthur Bik , Jan Draisma , Alessandro Oneto , Emanuele Ventura

Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…

Formal Languages and Automata Theory · Computer Science 2025-04-25 Emmanuel Filiot , Ismaël Jecker , Khushraj Madnani , Saina Sunny
‹ Prev 1 8 9 10 Next ›