Related papers: Counting Finite Topologies
This is a survey on recent results on counting of curves over finite fields. It reviews various results on the maximum number of points on a curve of genus g over a finite field of cardinality q, but the main emphasis is on results on the…
In this chapter, we present some recent progresses on the numerics for stochastic distributed parameter control systems, based on the \emph{finite transposition method} introduced in our previous works. We first explain how to reduce the…
We survey Weber's class number problem and its variants in the spirit of arithmetic topology; we recollect some history, present a relation to certain units and generalized Pell's equation, and overview a study of the $p$-adic limits of…
Let $(L,\vee)$ be a finite n-element semilattice where $n\geq 5$. We prove that the fourth largest number of subuniverses of an $n$-element semilattice is $25\cdot 2^{n-5}$, the fifth largest number is $ 24.5\cdot 2^{n-5}$, and the sixth…
We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory,…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
Tur\'an number is one of primary topics in the combinatorics of finite sets,in this paper, we will present a new upper bound for Tur\'an number.
In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.
We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…
This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…
Starting from filters over the set of indices, we introduce structures in a product of sets where the coordinate sets have the given structures.
We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$.
We study etale extensions of rings that have FIP.
We introduce the notions of topological entropy of a formal language and of a topological automaton. We show that the entropy function is surjective and bound the entropy of languages accepted by deterministic {\epsilon}-free push-down…
We define nodal finite dimensional algebras and describe their structure over an algebraically closed field. For a special class of such algebras (type A) we find a criterion of tameness.
We use a finite-element method to obtain highly converged results for a nano-optical light scattering setup with a non-periodic geometry.
We consider arrangements of n connected codimensional one submanifolds in closed d-dimensional manifold M. Let f be the number of connected components of the complement in M to the union of submanifolds. We prove the sharp lower bound for f…
We investigate the saturation rank of a finite group scheme, defined over an algebraically closed field $\Bk$ of positive characteristic $p$. We begin by exploring the saturation rank for finite groups and infinitesimal group schemes.…
In an earlier paper \cite{yu2021Finiteness}, we showed that there are finitely many stationary configurations (consisting of equilibria, rigidly translating configurations, relative equilibria and collapse configurations) in the planar…
We consider 9 infinite families of finite $p$-groups, for $p$ a prime, and we settle the isomorphism problem that arises when the parameters that define these groups are modified.