2,304 results for finite · 0.100s

arxiv.org/abs/1302.4251v1

A metrical lower bound on the star discrepancy of digital sequences

In this paper we study uniform distribution properties of digital sequences over a finite field of prime order. In 1998 it was shown by Larcher that for almost all $s$-dimensional digital sequences the star discrepancy $D_N^\ast$ satisfies an upper b...

Sponsored Partners
arxiv.org/abs/1302.3747v2

Construction of minimal non-abelian left group codes

Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class of groups G...

arxiv.org/abs/1310.7108v1

Finiteness of hitting times under taboo

We consider a continuous-time Markov chain with a finite or countable state space. For a site y and subset H of the state space, the hitting time of y under taboo H is defined to be infinite if the process trajectory hits H before y, and the first hi...

arxiv.org/abs/1007.0237v1

Exponential suppression with four legs and an infinity of loops

The L-loop 4-point ladder diagram of massless phi^3 theory is finite when all 4 legs are off-shell and is given in terms of polylogarithms with orders ranging from L to 2L. We obtain the exact solution of the linear Dyson-Schwinger equation that sums...

www.bing.com/ck/a?!&&p=05e416d4657f66bbcc3eab3e5ccea7d02f6ff6c8be5cc2133de22b9486e3abc8JmltdHM9MTc3MjQwOTYwMA&ptn=3&ver=2&hsh=4&fclid=3cbbd1e6-8eff-631e-0d27-c6f78f0562b3&u=a1aHR0cHM6Ly9tYXRoLnN0YWNrZXhjaGFuZ2UuY29tL3F1ZXN0aW9ucy8xNTM5MDIvdW4tY291bnRhYmxlLXVuaW9uLW9mLW9wZW4tc2V0cw&ntb=1

(Un-)Countable union of open sets - Mathematics Stack Exchange

Jun 4, 2012 · A remark: regardless of whether it is true that an infinite union or intersection of open sets is open, when you have a property that holds for every finite collection of sets (in this case, the union …

arxiv.org/abs/math/0203042v1

A norm for the cohomology of 2-complexes

We introduce a norm on the real 1-cohomology of finite 2-complexes determined by the Euler characteristics of graphs on these complexes. We also introduce twisted Alexander-Fox polynomials of groups and show that they give rise to norms on the real...

arxiv.org/abs/1811.03266v3

A sufficient condition for a 2-dimensional orbifold to be good

We prove that a connected 2-dimensional orbifold with finitely generated and infinite orbifold fundamental group is good. We also describe all the good 2-dimensional orbifolds with finite orbifold fundamental groups...

arxiv.org/abs/0710.5926v2

Mod 2 cohomology of 2-local finite groups of low rank

We determine the mod $2$ cohomology over the Steenrod algebra of the classifying spaces of the free loop groups $LG$ for compact groups $G=Spin(7)$, $Spin(8)$, $Spin(9)$, and $F_4$. Then, we show that they are isomorphic as algebras over the Steenrod...

arxiv.org/abs/0707.3756v1

Finite depth and Jacobson-Bourbaki correspondence

We introduce a notion of depth three tower of three rings C < B < A with depth two ring extension A | B recovered when B = C. If A = \End B_C and B | C is a Frobenius extension, this captures the notion of depth three for a Frobenius extension in a...

arxiv.org/abs/0709.1899v2

Yang-Yang thermodynamics on an atom chip

We investigate the behavior of a weakly interacting nearly one-dimensional (1D) trapped Bose gas at finite temperature. We perform in situ measurements of spatial density profiles and show that they are very well described by a model based on exact...

arxiv.org/abs/2312.14108v3

A Smooth Horizon without a Smooth Horizon

Recent observations on type III algebras in AdS/CFT raise the possibility that smoothness of the black hole horizon is an emergent feature of the large-$N$ limit. In this paper, we present a $bulk$ model for the finite-$N$ mechanism underlying this t...

arxiv.org/abs/2105.09000v1

Continuants with equal values, a combinatorial approach

A regular continuant is the denominator $K$ of a terminating regular continued fraction, interpreted as a function of the partial quotients. We regard $K$ as a function defined on the set of all finite words on the alphabet $1<2<3<\dots$ with values...

arxiv.org/abs/1510.08114v1

Words containing all permutations of a family of factors

We prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than linearly. This...

arxiv.org/abs/0801.1656v3

Palindromic Richness

In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense. A characteristic property of so-called "rich words" is that all complete returns to any...

arxiv.org/abs/2010.09081v2

A Ramsey Characterisation of Eventually Periodic Words

A factorisation $x = u_1 u_2 \cdots$ of an infinite word $x$ on alphabet $X$ is called `monochromatic', for a given colouring of the finite words $X^*$ on alphabet $X$, if each $u_i$ is the same colour. Wojcik and Zamboni proved that the word $x$ is...

arxiv.org/abs/1204.5490v1

Finding a princess in a palace: A pursuit-evasion problem

This paper solves a pursuit-evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied `Cops and Robbers Game', the prince has no kno...

arxiv.org/abs/1601.00930v1

Cohomology of finite modules over short Gorenstein rings

Let $R$ be a Gorenstein local ring with maximal ideal $\mathfrak{m}$ satisfying $\mathfrak{m}^3=0\ne\mathfrak{m}^2$. Set $k=R/\mathfrak{m}$ and $e=\text{rank}_{k}(\mathfrak{m}/\mathfrak{m}^2)$. If $e>2$ and $M$, $N$ are finitely generated $R$-modules...

arxiv.org/abs/2108.13441v2

On Integers Whose Sum is the Reverse of their Product

We determine all pairs of positive integers $(a,b)$ such that $a+b$ and $a \times b$ have the same decimal digits in reverse order: \[ (2,2), (9,9), (3,24), (2,47), (2,497), (2,4997), (2,49997), \ldots \] We use deterministic finite automata to descr...

arxiv.org/abs/1705.08747v2

On winning shifts of marked uniform substitutions

The second author introduced with I. Törmä a two-player word-building game [Playing with Subshifts, Fund. Inform. 132 (2014), 131--152]. The game has a predetermined (possibly finite) choice sequence $α_1$, $α_2$, $\ldots$ of integers such that o...

arxiv.org/abs/2408.14041v3

A model for horizontally restricted random square-tiled surfaces

A square-tiled surface (STS) is a (finite, possibly branched) cover of the standard square-torus with possible branching over exactly 1 point. Alternately, STSs can be viewed as finitely many axis-parallel squares with sides glued in parallel pairs....

arxiv.org/abs/2101.09573v2

RandomPoints package for Macaulay2

We present {\tt RandomPoints}, a package in \emph{Macaulay2} designed mainly to identify rational and geometric points in a variety over a finite field. We provide tools to estimate the dimension of a variety. We also present methods to obtain non-va...

arxiv.org/abs/1607.00798v3

The Finiteness Threshold Width of Lattice Polytopes

We prove that in each dimension $d$ there is a constant $w^\infty(d)\in \mathbb{N}$ such that for every $n\in \mathbb{N}$ all but finitely many $d$-polytopes with $n$ lattice points have width at most $w^\infty(d)$. We call $w^\infty(d)$ the finitene...

arxiv.org/abs/2602.20184v1

The Adams differentials on the $e$-family

The New Doomsday Conjecture (Minami, Amer. J. Math., 1995) states that, for any nonzero $\mathrm{Sq}^0$-family, only finitely many terms in this family survive to the $E_\infty$-page. On the Adams $1$ and $2$-line, the conjecture, which corresponds t...

arxiv.org/abs/1609.08353v2

A brief overview of the sock matching problem

This short note deals with the so-called $ Sock \; Matching \; Problem$. We define $B_{n,k}$ as the number of all the finite sequences $a_1, \ldots, a_{2n}$ of nonnegative integers which contain at least one occurrence of $k$ $(1 \leq k \leq n)$ and...

arxiv.org/abs/1511.05888v2

Preservation and decomposition theorems for bounded degree structures

We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class âd of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on âd, a âd-equiv...

arxiv.org/abs/2009.00311v1

Topological Complexities of Finite Digital Images

Digital topological methods are often used on computing the topological complexity of digital images. We give new results on the relation between reducibility and digital contractibility in order to determine the topological complexity of a digitally...