2,304 results for finite · 0.118s

Sponsored Partners
arxiv.org/abs/1406.6550v2

Semi-algebraic Ramsey numbers

Given a finite point set $P \subset \mathbb{R}^d$, a $k$-ary semi-algebraic relation $E$ on $P$ is the set of $k$-tuples of points in $P$, which is determined by a finite number of polynomial equations and inequalities in $kd$ real variables. The des...

arxiv.org/abs/1905.11755v3

Some Results on Linearized Trinomials that Split Completely

Linearized polynomials over finite fields have been much studied over the last several decades. Recently there has been a renewed interest in linearized polynomials because of new connections to coding theory and finite geometry. We consider the pr...

arxiv.org/abs/1611.05719v4

On Diophantine exponents for Laurent series over a finite field

In this paper, we study properties of the Diophantine exponents $w_n$ and $w_n^{*}$ for Laurent series over a finite field. We prove that for an integer $n\geq 1$ and a rational number $w>2n-1$, there exist a strictly increasing sequence of positive...

arxiv.org/abs/1111.3128v2

On Factor Groups of some Groups

Let for a prime $p$, $\mathfrak{X}$ (respectively $\mathfrak{Y}$) be the class of all $p$-biprimitively finite (respectively periodic $p$-conjugatively biprimitively finite) groups and $G\in \mathfrak{X}$ (respectively $G\in \mathfrak{Y}$), $V$ be a...

arxiv.org/abs/2504.17916v2

All finite lattices are stable matching lattices

We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices under standard assumptions on choice functions. In the process, we introduce new tools to reason on general lattices for optimization purposes: t...

arxiv.org/abs/1603.01899v1

Minimal energy configurations of finite molecular arrays

In this paper we consider the problem of characterizing the minimum energy configurations of a finite system of particles interacting between them due to attracting or repulsive forces given by a certain inter molecular potential. We limit ourselves...

arxiv.org/abs/1011.2169v1

Separating invariants for the basic G_a-actions

We explicitly construct a finite set of separating invariants for the basic $\Ga$-actions. These are the finite dimensional indecomposable rational linear representations of the additive group $\Ga$ of a field of characteristic zero, and their invari...

arxiv.org/abs/1608.07958v1

On the fastest finite Markov processes

Consider a finite irreducible Markov chain with invariant probability $π$. Define its inverse communication speed as the expectation to go from x to y, when x, y are sampled independently according to $π$. In the discrete time setting and when $π$...

arxiv.org/abs/1209.1952v1

On homotopy invariants of finite degree

We prove that homotopy invariants of finite degree distinguish homotopy classes of maps of a connected compact CW-complex to a nilpotent connected CW-complex with finitely generated homotopy groups....