Publications related to Identity element

Identity-Society (Mis)Alignment And The Instrumentalization Of Firm Creation: Creative Destruction And Creative Reconstruction

Research on founder identity has significantly advanced our understanding of entrepreneurship and related literatures. By departing from the widely held-though often implicit-assumption that culture defines the parameters of identity formation, this paper ...

ACAD MANAGEMENT2022

A Determinantal Identity for the Permanent of a Rank 2 Matrix

Adam Wade Marcus

We prove an identity relating the permanent of a rank 2 matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the possibility that t ...

TAYLOR & FRANCIS INC2022

On the equation A del u plus (del u)(t) A = G

Bernard Dacorogna, David Valentin Strütt

Let Omega subset of R-n be an open set, A is an element of R-nxn and G : Omega -> R-nxn be given. We look for a solution u : Omega -> R-n of the equation ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Packing the Boolean lattice with copies of a poset

Istvan Tomon

The Boolean lattice (2[n],subset of) is the family of all subsets of [n]={1,MIDLINE HORIZONTAL ELLIPSIS,n}, ordered by inclusion. Let P be a partially ordered set. We prove that if n is sufficiently large, then there exists a packing P of copies of P in (2 ...

WILEY2020

Adaptive isogeometric analysis on two-dimensional trimmed domains based on a hierarchical approach

Annalisa Buffa, Pablo Antolin Sanchez, Rafael Vazquez Hernandez, Luca Coradello

The focus of this work is on the development of an error-driven isogeometric framework, capable of automatically performing an adaptive simulation in the context of second- and fourth-order, elliptic partial differential equations defined on two-dimensiona ...

2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

Small subset sums

Gergely Ambrus

Let parallel to.parallel to be a norm in R-d whose unit ball is B. Assume that V subset of B is a finite set of cardinality n, with Sigma(v is an element of V) v = 0. We show that for every integer k with 0

Elsevier Science Inc2016

Some New Results On Differential Inclusions For Differential Forms

Bernard Dacorogna, Olivier Kneuss, Saugata Bandyopadhyay

In this article we study some necessary and sufficient conditions for the existence of solutions in W-0(1,infinity) (Omega; Lambda(k)) of the differential inclusion d omega is an element of E a.e. in Omega where E subset of Lambda(k+1) is a prescribed set. ...

Amer Mathematical Soc2015

Bifurcation without Frechet differentiability at the trivial solution

Charles Stuart

Criteria for the bifurcation of small solutions of an equation F(lambda,u) = 0 from a line {(lambda,0): lambda is an element of R} of trivial solutions are usually based on properties of the DuF(lambda,0) at the trivial solutions, where the partial derivat ...

Wiley-Blackwell2015

Invisibility and interpretation

Michael Herzog

Invisibility is often thought to occur because of the low-level limitations of the visual system. For example, it is often assumed that backward masking renders a target invisible because the visual system is simply too slow to resolve the target and the m ...

Frontiers Media2014

Multilevel Monte Carlo methods for stochastic elliptic multiscale PDEs

Assyr Abdulle

In this paper Monte Carlo finite element approximations for elliptic homogenization problems with random coefficients, which oscillate on n is an element of N a priori known, separated microscopic length scales, are considered. The convergence of multileve ...

2013

Revisiting Goal-Oriented Requirements Engineering with a Regulation View

Gil Regev, Alain Wegmann

Goal-Oriented Requirements Engineering (GORE) is considered to be one of the main achievements that the Requirements Engineering field has produced since its inception. Several GORE methods were designed in the last twenty years in both research and indust ...

2012

Predicting The Ultimate Supremum Of A Stable Levy Process With No Negative Jumps

Robert Dalang, Violetta Bernyk

Given a stable Levy process X = (X-t)(0

2011

The Exact Hausdorff Measure of the Zero Set of Fractional Brownian Motion

Thomas Mountford, Driss Baraka

Let {X(t), t is an element of R-N} be a fractional Brownian motion in R-d of index H. If L(0,I) is the local time of X at 0 on the interval I subset of R-N, then there exists a positive finite constant c(=c(N,d,H)) such that ...

Springer US2011

On the scaling of polar codes: II. The behavior of un-polarized channels

Rüdiger Urbanke, Seyed Hamed Hassani

We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes where transmission takes place over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bha ...

IEEE2010

Statistics Of Prime Divisors In Function Fields

Robert Christopher Rhoades

We show that the prime divisors of a random polynomial in F-q[t] are typically "Poisson distributed". This result is analogous to the result in Z of Granville [1]. Along the way, we use a sieve developed by Granville and Soundararajan [2] to give a simple ...

2009

On the equation det del u = f with no sign hypothesis

Bernard Dacorogna, Olivier Kneuss

We prove existence of u is an element of C-k ((Omega) over bar ;R-n) satisfying ...

Springer-Verlag2009