2,304 results for finite · 0.108s

arxiv.org/abs/2008.05262v1

The Topology of Shapes Made with Points

In architecture, city planning, visual arts, and other design areas, shapes are often made with points, or with structural representations based on point-sets. Shapes made with points can be understood more generally as finite arrangements formed wit...

Sponsored Partners
arxiv.org/abs/cs/0410035v1

Overhead-Free Computation, DCFLs, and CFLs

We study Turing machines that are allowed absolutely no space overhead. The only work space the machines have, beyond the fixed amount of memory implicit in their finite-state control, is that which they can create by cannibalizing the input bits'...

arxiv.org/abs/2505.00683v2

Quantum Circuit Overhead

We introduce a measure for evaluating the efficiency of finite universal quantum gate sets $\mathcal{S}$, called the Quantum Circuit Overhead (QCO), and the related notion of $T$-Quantum Circuit Overhead ($T$-QCO). The overhead is based on the compar...

arxiv.org/abs/cs/0008015v1

Temiar Reduplication in One-Level Prosodic Morphology

Temiar reduplication is a difficult piece of prosodic morphology. This paper presents the first computational analysis of Temiar reduplication, using the novel finite-state approach of One-Level Prosodic Morphology originally developed by Walther (...

arxiv.org/abs/math/0411459v1

Greedy lattice animals: geometry and criticality (with an Appendix)

Assign to each site of the integer lattice $\Zd$ a real score, sampled according to the same distribution $F$, independently of the choices made at all other sites. A lattice animal is a finite connected set of sites, with its weight being the sum...

arxiv.org/abs/1002.2786v3

Finding non-trivial elements and splittings in groups

It is well known that the triviality problem for finitely presented groups is unsolvable; we ask the question of whether there exists a general procedure to produce a non-trivial element from a finite presentation of a non-trivial group. If not, then...

arxiv.org/abs/2010.05799v1

Some classical model theoretic aspects of bounded shrub-depth classes

We consider classes of arbitrary (finite or infinite) graphs of bounded shrub-depth, specifically the class $\mathrm{TM}_{r, p}(d)$ of $p$-labeled arbitrary graphs whose underlying unlabeled graphs have tree models of height $d$ and $r$ labels. We sh...

arxiv.org/abs/0706.0954v2

Growth and mixing

Given a bi-Lipschitz measure-preserving homeomorphism of a compact metric measure space of finite dimension, consider the sequence formed by the Lipschitz norms of its iterations. We obtain lower bounds on the growth rate of this sequence assuming...

arxiv.org/abs/1405.1620v4

A non-LEA Sofic Group

We describe elementary examples of finitely presented sofic groups which are not residually amenable (and thus not initially subamenable or LEA, for short). We ask if an amalgam of two amenable groups over a finite subgroup is residually amenable and...

arxiv.org/abs/1002.3479v1

Protecting subspaces by acting on the outside

Many quantum control tasks aim at manipulating the state of a quantum mechanical system within a finite subspace of states. However, couplings to the outside are often inevitable. Here we discuss strategies which keep the system in the controlled s...

arxiv.org/abs/0909.0244v2

A Class of Hilbert Series and the Strong Lefschetz Property

We determine the class of Hilbert series H so that if M is a finitely generated zero-dimensional R-graded module with the strong Lefschetz property, then the tensor product of M and k[y]/(y^m) has the strong Lefschetz property for y an indeterminat...

arxiv.org/abs/1110.6455v3

Cutting down trees with a Markov chainsaw

We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on a couplin...

www.bing.com/ck/a?!&&p=f70415d11578206fc45db2c1f1f0c88a9a194917bf215b1022f6ff8f46fd1dbdJmltdHM9MTc3MjY2ODgwMA&ptn=3&ver=2&hsh=4&fclid=155f3ef3-e58f-6aef-2c2a-29e0e4f16b25&u=a1aHR0cHM6Ly9tYXRoLnN0YWNrZXhjaGFuZ2UuY29tL3F1ZXN0aW9ucy90YWdnZWQvY29tYmluYXRvcmljcz90YWI9TmV3ZXN0&ntb=1

Newest 'combinatorics' Questions - Mathematics Stack Exchange

4 days ago · For questions about the study of finite or countable discrete structures, especially how to count or enumerate elements in a set (perhaps of all possibilities) or any subset. It includes …

arxiv.org/abs/1412.8181v1

States that are far from being stabilizer states

Stabilizer states are eigenvectors of maximal commuting sets of operators in a finite Heisenberg group. States that are far from being stabilizer states include magic states in quantum computation, MUB-balanced states, and SIC vectors. In prime dimen...

arxiv.org/abs/1507.08964v5

Squashed entanglement in infinite dimensions

We analyse two possible definitions of the squashed entanglement in an infinite-dimensional bipartite system: direct translation of the finite-dimensional definition and its universal extension. It is shown that the both definitions produce the same...

arxiv.org/abs/math/0511421v1

Refinable shift invariant spaces in R^d

Let $φ: \R^d \longrightarrow \C$ be a compactly supported function which satisfies a refinement equation of the form $φ(x) = \sum_{k\inΛ} c_k φ(Ax - k),\quad c_k\in\C$, where $Γ\subset\R^d$ is a lattice, $Λ$ is a finite subset of $Γ$, and $A...

arxiv.org/abs/2004.08627v4

Twisted forms of classical groups

We give a unified description of twisted forms of classical reductive groups schemes. Such group schemes are constructed from algebraic objects of finite rank, excluding some exceptions of small rank. These objects, augmented odd form algebras, consi...

arxiv.org/abs/2110.12031v2

Majorization and Semi-Doubly Stochastic Operators on $L^1(X)$

This article is devoted to a study of majorization based on semi-doubly stochastic operators (denoted by $S\mathcal{D}(L^1)$) on $L^1(X)$ when $X$ is a $σ$-finite measure space. We answered Mirsky's question and characterized the majorization by mea...

arxiv.org/abs/0902.1932v1

On the cardinality constrained matroid polytope

Given a combinatorial optimization problem $Π$ and an increasing finite sequence $c$ of natural numbers, we obtain a cardinality constrained version $Π_c$ of $Π$ by permitting only those feasible solutions of $Π$ whose cardinalities are members...

arxiv.org/abs/2504.05360v1

The derived moduli of Stokes data

The goal of this paper is to show that Stokes data coming from flat bundles form a locally geometric derived stack locally of finite presentation. This generalizes existing geometricity results on Stokes data in four different directions: our result...

arxiv.org/abs/1203.3933v1

Concurrence for infinite-dimensional quantum systems

Concurrence is an important entanglement measure for states in finite-dimensional quantum systems that was explored intensively in the last decade. In this paper, we extend the concept of concurrence to infinite-dimensional bipartite systems and show...

arxiv.org/abs/1708.06911v1

On Words with the Zero Palindromic Defect

We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors of a longer rich wor...

arxiv.org/abs/1108.3623v1

Recurrent Partial Words

Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite partial wor...

arxiv.org/abs/math/0109152v10

Clairvoyant scheduling of random walks

Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks compatibl...

arxiv.org/abs/2105.14912v3

Significant contribution to the Frankl's union-closed conjecture

A celebrated unresolved conjecture of Peter Frankl states that every finite union-closed collection of sets ($B$), with non-empty universe, admits an abundant element. The best result in the literature states that if $|B|=n$, then there exists $x$ in...

arxiv.org/abs/1906.06284v1

Peter-Weyl bases, preferred deformations, and Schur-Weyl duality

We discuss the deformed function algebra of a simply connected reductive Lie group G over the complex numbers using a basis consisting of matrix elements of finite dimensional representations. This leads to a preferred deformation, meaning one where...

arxiv.org/abs/1506.00813v2

On the Curling Number of Certain Graphs

In this paper, we introduce the concept of curling subsequence of simple, finite and connected graphs. A curling subsequence is a maximal subsequence $C$ of the degree sequence of a simple connected graph $G$ for which the curling number $cn(G)$ corr...