2,304 results for finite · 0.135s

arxiv.org/abs/2301.11406v1

Beyond Arabic: Software for Perso-Arabic Script Manipulation

This paper presents an open-source software library that provides a set of finite-state transducer (FST) components and corresponding utilities for manipulating the writing systems of languages that use the Perso-Arabic script. The operations include...

arxiv.org/abs/math/0611798v2

On combinatorial problem concerning partitions of a box into boxes

We consider partitions of n-dimensional boxes in R^n, n>1, into a finite number of boxes with pairwise disjoint interiors. We study sets X \subseteq (0,\infty) with the Property (W_n): for every n-dimensional box P and every partition of P, if each...

Sponsored Partners
arxiv.org/abs/2303.05228v1

A classification of S-boxes generated by Orthogonal Cellular Automata

Most of the approaches published in the literature to construct S-boxes via Cellular Automata (CA) work by either iterating a finite CA for several time steps, or by a one-shot application of the global rule. The main characteristic that brings toget...

arxiv.org/abs/math/0609846v2

Cramped subgroups and generalized Harish-Chandra modules

Let G be a reductive complex Lie group with Lie algebra g. We call a subgroup H of G {\bf cramped} if there is an integer b(G,H) such that each finite dimensional representation of G has a non-trivial invariant subspace of dimension less than b(G,H...

arxiv.org/abs/2212.11420v2

Nonradial stability of expanding Goldreich-Weber stars

Goldreich-Weber solutions constitute a finite-parameter of expanding and collapsing solutions to the mass-critical Euler-Poisson system. Two subclasses of this family correspond to compactly supported density profiles suitably modulated by the dynami...

arxiv.org/abs/1208.5389v1

Phases of supersymmetric O(N) theories

We perform a global renormalization group study of O(N) symmetric Wess-Zumino theories and their phases in three euclidean dimensions. At infinite N the theory is solved exactly. The phases and phase transitions are worked out for finite and infinite...

arxiv.org/abs/1903.09824v4

New Constructions of Group-Invariant Butson Hadamard Matrices

Let $G$ be a finite group and let $h$ be a positive integer. A $\text{BH}(G,h)$ matrix is a $G$-invariant $|G|\times |G|$ matrix $H$ whose entries are complex $h$th roots of unity such that $HH^*=|G|I_{|G|}$, where $H^*$ denotes the complex conjugate...

arxiv.org/abs/2208.11732v1

Attractor Stability in Finite Asynchronous Biological System Models

We present mathematical techniques for exhaustive studies of long-term dynamics of asynchronous biological system models. Specifically, we extend the notion of $κ$-equivalence developed for graph dynamical systems to support systematic analysis of a...

arxiv.org/abs/1512.05733v1

Lagrangian coherent structures and inertial particle dynamics

In this work we investigate the dynamics of inertial particles using finite-time Lyapunov exponents (FTLE). In particular, we characterize the attractor and repeller structures underlying preferential concentration of inertial particles in terms of F...

arxiv.org/abs/2005.05108v4

Whole-grain Petri nets and processes

We present a formalism for Petri nets based on polynomial-style finite-set configurations and etale maps. The formalism supports both a geometric semantics in the style of Goltz and Reisig (processes are etale maps from graphs) and an algebraic seman...

arxiv.org/abs/1909.08373v3

On the Infinite Lucchesi-Younger Conjecture I

A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of an edge set meeting every dicut equals the maximu...

www.bing.com/ck/a?!&&p=5413ca2560fc0a76c9cd686954214610c70bde30656b18256007f48de9377d89JmltdHM9MTc3MjQ5NjAwMA&ptn=3&ver=2&hsh=4&fclid=29cecd69-c8df-6e28-014d-da78c94b6ffb&u=a1aHR0cHM6Ly9lbi53aWtpcGVkaWEub3JnL3dpa2kvQ291bnRpbmc&ntb=1

Counting - Wikipedia

Counting is the process of determining the number of elements of a finite set of objects; that is, determining the size of a set.

en.wikipedia.org/wiki/Counting

Counting - Wikipedia

Counting is the process of determining the number of elements of a finite set of objects; that is, determining the size of a set. The traditional way of

arxiv.org/abs/1610.05137v1

The canonical join complex

In this paper, we study the combinatorics of a certain minimal factorization of the elements in a finite lattice $L$ called the canonical join representation. The join $\bigvee A =w$ is the canonical join representation of $w$ if $A$ is the unique lo...

arxiv.org/abs/0705.4652v2

A real Lorentz-FitzGerald contraction

Many condensed matter systems are such that their collective excitations at low energies can be described by fields satisfying equations of motion formally indistinguishable from those of relativistic field theory. The finite speed of propagation o...

arxiv.org/abs/1906.00296v1

The Theory of Weak Revealed Preference

We offer a rationalization of the weak generalized axiom of revealed preference (WGARP) for both finite and infinite data sets of consumer choice. We call it maximin rationalization, in which each pairwise choice is associated with a "local" utility...

arxiv.org/abs/math/0111120v1

Growth of Betti Numbers

Suppose X is any finite complex with vanishing L^2 Betti number. We prove upper bounds on the Betti numbers for regular coverings of X, sublinear in the order of covering. The bounds are sensitive to the Novikov-Shubin invariants of X, and are impr...

arxiv.org/abs/2407.11411v1

Basic Tetravalent Oriented Graphs of Independent-Cycle Type

The family $\mathcal{OG}(4)$ consisting of graph-group pairs $(Γ, G)$, where $Γ$ is a finite, connected, 4-valent graph admitting a $G$-vertex-, and $G$-edge-transitive, but not $G$-arc-transitive action, has recently been examined using a normal q...

arxiv.org/abs/2211.03749v2

On renewal theory for cluster processes

We prove several forms of renewal theorem tailored to renewal processes with marks and clusters. In particular, for an i.i.d. sequence $(ξ_i,X_i)_{i \geq 0}$, where $ξ_0$ denotes a finite point process on $\mathbb{R}$ and $X_0$ denotes a nonnegativ...

arxiv.org/abs/1111.0674v5

On Ramsey properties of classes with forbidden trees

Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $σ$. There is a natural way to expand Forbh(F) by unary rel...

arxiv.org/abs/1409.0584v2

Kolmogorov structure functions for automatic complexity

For a finite word $w$ we define and study the Kolmogorov structure function $h_w$ for nondeterministic automatic complexity. We prove upper bounds on $h_w$ that appear to be quite sharp, based on numerical evidence....

arxiv.org/abs/1906.01521v1

Quasi-automatic groups are asynchronously automatic

A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a quasi-automatic semigr...

arxiv.org/abs/math/0212335v1

A Mad Q-set

A MAD (maximal almost disjoint) family is an infinite subset A of the infinite subsets of {0,1,2,..} such that any two elements of A intersect in a finite set and every infinite subset of {0.1.2...} meets some element of $å$ in an infinite set. A...

arxiv.org/abs/2411.02339v3

Quantum detailed balance via elementary transitions

Quantum detailed balance is formulated in terms of elementary transitions, in close analogy to detailed balance in a classical Markov chain on a finite set of points. An elementary transition is taken to be a pure state of two copies of the quantum s...

arxiv.org/abs/1505.05795v1

Three-dimensional manifolds with poor spines

A special spine of a three-manifold is said to be poor if it does not contain proper simple subpolyhedra. Using the Turaev-Viro invariants, we establish that every compact three-dimensional manifold M with connected nonempty boundary has a finite num...