2,304 results for finite · 0.150s

arxiv.org/abs/2502.01950v1

Character codegrees, kernels, and Fitting heights of solvable groups

For an irreducible character $χ$ of a finite group $G$, let $\mathrm{cod}(χ):=|G: \ker(χ)|/χ(1)$ denote the codegree of $χ$, and let $\mathrm{cod}(G)$ be the set of irreducible character codegrees of $G$. In this note, we prove that if $\ker(χ)...

Sponsored Partners
arxiv.org/abs/2406.17368v2

On the total Italian domination number in digraphs

Consider a finite simple digraph $D$ with vertex set $V(D)$. An Italian dominating function (IDF) on $D$ is a function $f:V(D)\rightarrow\{0,1,2\}$ satisfying every vertex $u$ with $f(u)=0$ has an in-neighbor $v$ with $f(v)=2$ or two in-neighbors $w$...

arxiv.org/abs/2005.10652v1

Towards Finite-State Morphology of Kurdish

Morphological analysis is the study of the formation and structure of words. It plays a crucial role in various tasks in Natural Language Processing (NLP) and Computational Linguistics (CL) such as machine translation and text and speech generation....

arxiv.org/abs/0711.3615v1

Urban segregation with cheap and expensive residences

In this paper we study urban segregation of two different communities A and B, poor and rich, distributed randomly on finite samples, to check cheap and expensive residences. For this purpose we avoid the complications of the Schelling model which...

arxiv.org/abs/2502.07672v2

Cheap Permutation Testing

Permutation tests are a popular choice for distinguishing distributions and testing independence, due to their exact, finite-sample control of false positives and their minimax optimality when paired with U-statistics. However, standard permutation t...

arxiv.org/abs/2506.07098v1

A decisive Theorem (Un théorème décisif)

We give an elementary proof of the theorem which states that a finite unramified algebra over a discrete field is tracically étale. -- Nous donnons une démonstration élémentaire du théorème selon lequel toute algèbre nette sur un cors disc...

arxiv.org/abs/1801.01014v1

Finite asymptotic clusters of metric spaces

Let $(X, d)$ be an unbounded metric space and let $\tilde r=(r_n)_{n\in\mathbb N}$ be a sequence of positive real numbers tending to infinity. A pretangent space $Ω_{\infty, \tilde r}^{X}$ to $(X, d)$ at infinity is a limit of the rescaling sequence...

arxiv.org/abs/1704.00531v1

Asymptotic behavior of metric spaces at infinity

A new sequential approach to investigations of structure of metric spaces at infinity is proposed. Criteria for finiteness and boundedness of metric spaces at infinity are found....

arxiv.org/abs/1603.03705v2

Probabilistic Models for the (sub)Tree(s) of Life

The goal of these lectures is to review some mathematical aspects of random tree models used in evolutionary biology to model gene trees or species trees. We start with stochastic models of tree shapes (finite trees without edge lengths), culminating...

arxiv.org/abs/2206.10514v1

How to quantise probabilities while preserving their convex order

We introduce an algorithm which, given probabilities $μ\leq_{\text{cx}} ν$ in convex order and defined on a separable Banach space $B$, constructs finitely-supported approximations $μ_n \to μ, ν_n\to ν$ which are in convex order $μ_n \leq_{\te...

arxiv.org/abs/1005.2803v2

Partition theorems from creatures and idempotent ultrafilters

We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of the Hindm...

arxiv.org/abs/2311.04401v1

The edge-girth-regularity of Wenger graphs

Let $n\ge 1$ be an integer and $\mathbb{F}_q$ be a finite field of characteristic $p$ with $q$ elements. In this paper, it is proved that the Wenger graph $W_n(q)$ and linearized Wenger graph $L_m(q)$ are edge-girth-regular $(v,k,g,λ)$-graphs, and t...

arxiv.org/abs/1402.3341v1

On the Spectrum of Wenger Graphs

Let $q=p^e$, where $p$ is a prime and $e\geq 1$ is an integer. For $m\geq 1$, let $P$ and $L$ be two copies of the $(m+1)$-dimensional vector spaces over the finite field $\mathbb{F}_q$. Consider the bipartite graph $W_m(q)$ with partite sets $P$ and...

www.microsoft.com/en-us/diversity/

Microsoft Global Diversity and Inclusion | Microsoft

In over 20 years of committed diversity and inclusion efforts, we’ve learned that diversity is not a finite goal; it is a journey that requires constant self-assessment and recommitment.