2,304 results for finite · 0.137s

Sponsored Partners
arxiv.org/abs/2001.06711v1

The Heritage of Cayley-Sudoku Tables

A Cayley-Sudoku table of a finite group G is a Cayley table for G subdivided into uniformly sized rectangular blocks, in such a way that each group element appears once in each block. They were introduced by J. Carmichael, K. Schloeman, and M. B. War...

arxiv.org/abs/1309.1859v1

The MOR cryptosystem and finite $p$-groups

The ElGamal cryptosystem is the most widely used public key cryptosystem. It uses the discrete logarithm problem as the cryptographic primitive. The MOR cryptosystem is a similar cryptosystem. It uses the discrete logarithm problem in the automorphis...

github.com/awslabs/palace

awslabs/palace

3D finite element solver for computational electromagnetics (⭐ 466)

arxiv.org/abs/1303.3539v1

A short proof of Kneser's addition theorem for abelian groups

Martin Kneser proved the following addition theorem for every abelian group $G$. If $A,B \subseteq G$ are finite and nonempty, then $|A+B| \ge |A+K| + |B+K| - |K|$ where $K = \{g \in G \mid g+A+B = A+B \}$. Here we give a short proof of this based on...

arxiv.org/abs/2602.01108v1

Skewness in the Hellings-Downs curve

Recent Pulsar Timing Array datasets provide compelling evidence for a nano-Hertz gravitational-wave background, but robust detection requires characterizing statistical fluctuations of the Hellings-Downs (HD) correlation expected from a finite popula...

arxiv.org/abs/1402.0366v2

On a conjecture of Gluck

Let $F(G)$ and $b(G)$ respectively denote the Fitting subgroup and the largest degree of an irreducible complex character of a finite group $G$. A well-known conjecture of D. Gluck claims that if $G$ is solvable then $|G:F(G)|\leq b(G)^{2}$. We confi...

arxiv.org/abs/2408.03434v2

The Comma Sequence is Finite in Other Bases

The comma sequence (1, 12, 35, 94, ...) is the lexicographically earliest sequence such that the difference of consecutive terms equals the concatenation of the digits on either side of the comma separating them. The behavior of a "generalized comma...

arxiv.org/abs/2506.09884v1

Bootstrapping Gravity with Crossing Symmetric Dispersion Relations

We derive bounds on Wilson coefficients in gravitational effective field theories using fully crossing symmetric dispersion relations. These sum rules naturally isolate finite subsets of low-energy couplings without relying on the forward limit or sp...

arxiv.org/abs/1505.04383v3

How to refute a random CSP

Let $P$ be a $k$-ary predicate over a finite alphabet. Consider a random CSP$(P)$ instance $I$ over $n$ variables with $m$ constraints. When $m \gg n$ the instance $I$ will be unsatisfiable with high probability, and we want to find a refutation - i....

arxiv.org/abs/2011.05936v2

Orientations of infinite graphs

Building on recent work by Thomassen, we show that Nash-Williams' orientation theorem, that every finite $2k$-edge-connected multigraph has a $k$-arc-connected orientation, also holds for all infinite multigraphs....

arxiv.org/abs/1603.01875v1

Continuum Eigenmodes in Some Linear Stellar Models

We apply parallel approaches in the study of continuous spectra to adiabatic stellar models. We seek continuum eigenmodes for the LAWE formulated as both finite difference and linear differential equations. In particular, we apply methods of Jacobi m...

arxiv.org/abs/1901.03492v1

4-Regular prime graphs of nonsolvable groups

Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $Δ(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $ρ(G)$. Two primes $p,q\in ρ(G)$ are...

en.wikipedia.org/wiki/Normalizing_constant

Normalizing constant - Wikipedia

In probability theory, a normalizing constant or normalizing factor is used to reduce any nonnegative function whose integral is finite to a probability

arxiv.org/abs/1411.7220v2

Fluid limit for the Poisson encounter-mating model

Stochastic encounter-mating (SEM) models describe monogamous permanent pair formation in finite zoological populations of multitype females and males. In this article, we study SEM with Poisson firing times. First, we prove that the model enjoys a fl...

arxiv.org/abs/1911.08983v2

The Hodge Laplacian on Axisymmetric Domains and its Discretization

We study the mixed formulation of the abstract Hodge Laplacian on axisymmetric domains with general data through Fourer-finite-element-methods in weighted functions spaces. Closed Hilbert complexes and commuting projectors are used through a family o...

arxiv.org/abs/1706.06733v4

Tamely ramified torsors and parabolic bundles

Given a variety $X$, and a normal crossings divisor $D\subset X$, we relate, in the case of abelian monodromy, the following two: 1. existence of a $G$-torsor with prescribed ramification, and 2. existence of essentially finite parabolic vector b...

arxiv.org/abs/1610.07341v3

Fundamental gerbes

For a class of affine algebraic groups $\mathcal C$ over a field, we define the notions of $\mathcal C$-fundamental gerbe of a fibered category, generalizing what we had done in arXiv:1204.1260 for finite group schemes. We give sufficient conditions...

arxiv.org/abs/math/0204088v1

A relative Shafarevich theorem

Suppose given a Galois etale cover Y -> X of proper non-singular curves over an algebraically closed field k of prime characteristic p. Let H be its Galois group, and G any finite extension of H by a p-group P. We give necessary and sufficient cond...

arxiv.org/abs/1402.2786v1

The deepest point for distributions in infinite dimensional spaces

Identification of the center of a data cloud is one of the basic problems in statistics. One popular choice for such a center is the median, and several versions of median in finite dimensional spaces have been studied in the literature. In particula...

arxiv.org/abs/1404.1581v3

Jordan groups and algebraic surfaces

We prove that an analogue of Jordan's theorem on finite subgroups of general linear groups holds for the groups of biregular automorphisms of algebraic surfaces. This gives a positive answer to a question of Vladimir L. Popov....

en.wikipedia.org/wiki/Complex_reflection_group

Complex reflection group - Wikipedia

complex reflection group W ⊆ G L ( V ) {\displaystyle W\subseteq GL(V)} is a finite subgroup of G L ( V ) {\displaystyle GL(V)} that is generated by reflections

arxiv.org/abs/2005.05470v2

Hidden symmetries in non-self-adjoint graphs

On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators. In [Husse...

arxiv.org/abs/2311.18049v1

Fluctuations and Correlations in Causal Diamonds

We argue that the correlation between the modular Hamiltonians of two causal diamonds related by a finite time translation is equal to the uncertainty in the modular Hamiltonian of the diamond in their overlap. In a separate section we investigate th...

arxiv.org/abs/1507.00423v2

Spacetime diamonds

We show that the particle-number distribution of diamond modes, modes that are localized in a finite space-time region, are thermal for the Minkowski vacuum state of a massless scalar field, an analogue to the Unruh effect. The temperature of the dia...

arxiv.org/abs/1701.01260v1

Bounding Harish-Chandra series

We use the progenerator constructed in our previous paper to give a necessary condition for a simple module of a finite reductive group to be cuspidal, or more generally to obtain information on which Harish-Chandra series it can lie in. As a first a...

arxiv.org/abs/1304.5962v3

The pricing formula for cancellable European options

This paper examines the value of a cancellable European option in a finite time horizon setting. The specifications of this generalized European option allow the seller to cancel the option at any point in time for a fixed penalty paid directly to th...

www.bing.com/ck/a?!&&p=43d979f1fe4399e96f66512d7a5d6cfbc9830784a92ad44e103cf8595ea30b3eJmltdHM9MTc3Mjg0MTYwMA&ptn=3&ver=2&hsh=4&fclid=1ff3f1c0-b2b7-64b7-3aa1-e6d5b3c265d6&u=a1aHR0cHM6Ly9lamplLndlYmxpby5qcC9jb250ZW50L2Jl&ntb=1

beの意味・使い方・読み方・覚え方 | Weblio英和辞書

I wonder what it is. Several of the finite forms of be have special negative forms, containing the suffix -n’t, that can be used instead of adding the adverb not.