Related papers: Strongly minimal pseudofinite structures

We study definably complete locally o-minimal expansions of ordered groups in this paper. A definable continuous function defined on a closed, bounded and definable set behave like a continuous function on a compact set. We demonstrate…

We prove several structural results on definably compact groups G in o-minimal expansions of real closed fields, such as (i) G is definably an almost direct product of a semisimple group and a commutative group, and (ii) the group (G, .) is…

Given feasible strongly regular graph parameters $(v,k,\lambda,\mu)$ and a non-negative integer $d$, we determine upper and lower bounds on the order of a $d$-regular induced subgraph of any strongly regular graph with parameters…

In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…

Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of particular interest because of their relation to various…

It is known that locally compact groups approximable by finite ones are unimodular, but this condition is not sufficient, for example, the simple Lie groups are not approximable by finite ones as topological groups. In this paper the…

Dense subgraph discovery is a fundamental primitive in graph and hypergraph analysis which among other applications has been used for real-time story detection on social media and improving access to data stores of social networking…

We announce various results concerning the structure of compactly generated simple locally compact groups. We introduce a local invariant, called the structure lattice, which consists of commensurability classes of compact subgroups with…

We investigate $f$-Diophantine sets over finite fields via new explicit constructions of families of quasi-random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for…

Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…

We show that semi-infinite cohomology of a finite dimensional graded algebra (satisfying some additional requirements) are a particular case of a general categorical construction. The motivating example is provided by small quantum groups…

The affinely regular polygons in certain planar sets are characterized. It is also shown that the obtained results apply to cyclotomic model sets and, additionally, have consequences in the discrete tomography of these sets.

We give an example of a definable quotient in an o-minimal structure which cannot be eliminated over any set of parameters, giving a negative answer to a question of Eleftheriou, Peterzil, and Ramakrishnan. Equivalently, there is an…

We give an example of a dense o-minimal structure in which there is a definable quotient that cannot be eliminated, even after naming parameters. Equivalently, there is an interpretable set which cannot be put in parametrically definable…

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…

Let A be a noetherian AS regular Koszul quiver algebra (if A is commutative, it is essentially a polynomial ring), and grA the category of finitely generated graded left A-modules. Following Jorgensen, we define the Castelnuovo-Mumford…

We prove that every $2d$-regular unimodular random network carries an invariant random Schreier decoration. Equivalently, it is the Schreier coset graph of an invariant random subgroup of the free group $F_d$. As a corollary we get that…

In this manuscript we prove the Bernstein inequality and develop the theory of holonomic D-modules for rings of invariants of finite groups in characteristic zero, and for strongly F-regular finitely generated graded algebras with FFRT in…

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

Modularity is a parameter indicating the presence of community structure in the graph. Nowadays it lies at the core of widely used clustering algorithms. We study the modularity of the most classical random graph, binomial $G(n,p)$. In 2020…